×

zbMATH — the first resource for mathematics

Chromatic polynomials of a family of graphs. (English) Zbl 0532.05027
This paper obtains the chromatic polynomials of all connected graphs having k edges, k-2 vertices, all vertices of degree \(\geq 2\) and \(k\geq 6\). The class includes the graphs homeomorphic to \(K_ 4\) (also called the subdivisions of \(K_ 4)\), and it is shown that there are non- isomorphic such graphs having the same chromatic polynomial. This answers a question posed by R. C. Read.
Reviewer: B.Toft

MSC:
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite