Chromatic polynomials of generalized trees

DOI10.1016/0012-365X(88)90231-2zbMath0659.05045MaRDI QIDQ1112057

Earl Glen jun. Whitehead

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatically equivalent graphschromatic polynomialsgeneralized trees

Mathematics Subject Classification ID

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

Related Items (6)

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs ⋮ Classes of chromatically equivalent graphs and polygon trees ⋮ The size of \(k\)-pseudotrees ⋮ The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ Chromaticity of series-parallel graphs

Cites Work

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

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