I'm supposed to determine chromatic polynomial of a $8$-vertex graph, which is the result of sticking
There are two complete $5$-vertex graphs, each with one edge removed, in the first graph we remove the edge $uv$ and in the second graph we remove $u'v'$. Then we stick the graphs together by putting $u=u'$ and $v=v'$ . I hope the description is quite clear, because I don't know how to insert the image of this graph.
It seems pointless to try using the recurrence formula for chromatic polynomial of a graph (by trying to get complete graphs by contracting together two unconnected vertices and drawing an additional edge linking them).
Could you help me with that?