Classes of chromatically equivalent graphs and polygon trees

DOI10.1016/0012-365X(94)90033-7zbMath0813.05030OpenAlexW1968267776MaRDI QIDQ1336708

Shao-Ji Xu

Publication date: 22 May 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90033-7

zbMATH Keywords

chromatic polynomialchromatically equivalentchromatic equivalencechromatically uniqueintercourse numberpolygon trees

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

The chromaticity of \(s\)-bridge graphs and related graphs ⋮ The search for chromatically unique graphs. II ⋮ Chromatic equivalence classes of certain generalized polygon trees ⋮ A bibliography on chromatic polynomials ⋮ Chromaticity of series-parallel graphs ⋮ Chromaticity of a family of \(K_ 4\)-homeomorphs

Cites Work

• Unnamed Item
• The chromaticity of wheels
• The search for chromatically unique graphs
• On trees of polygons
• Chromatic polynomials of generalized trees
• Cutpoints and the chromatic polynomial
• Chromaticity of two-trees
• Onq-trees
• On chromatic equivalence of graphs
• An introduction to chromatic polynomials

This page was built for publication: Classes of chromatically equivalent graphs and polygon trees