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)

zbMATH Keywords

chromatic polynomialschromatically equivalent graphsgeneralized trees

Mathematics Subject Classification ID

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

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)

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

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)