Chromatic polynomials of generalized trees

DOI10.1016/0012-365X(88)90231-2MaRDI QIDQ1112057zbMATH OpenFDO

Authors Earl Glen jun. Whitehead

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(88)90231-2

zbMATH Keywords

chromatic polynomialschromatically equivalent graphsgeneralized trees

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Review text

This short note surveys some recent results on chromatic polynomials of graphs built up in a treelike manner of q-cliques (yieldig q-trees) or of n-gons (n-gon-trees).

Cites work

• Chromatic polynomials of connected graphs
• Chromaticity of two-trees
• On chromatic equivalence of graphs
• On trees of polygons
• Onq-trees
• The chromaticity of wheels

Cited in

(8)

• Classes of chromatically equivalent graphs and polygon trees
• The search for chromatically unique graphs. II
• A bibliography on chromatic polynomials
• Determinantal generating functions of colored spanning forests
• The size of \(k\)-pseudotrees
• Chromaticity of series-parallel graphs
• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
• Tree-chromatic number

This page was built for publication: Chromatic polynomials of generalized trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112057)