×

zbMATH — the first resource for mathematics

On supercycles C(a,b,c). (English) Zbl 0658.05030
This paper determines the chromatic polynomial of the supercycle C(a,b,c), \(a<b<c\). In addition to finding the polynomial for these graphs it is shown that C(a,b,c) is the only graph with this chromatic polynomial (i.e. C(a,b,c) is chromatically unique).
Reviewer: R.E.Aldred

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