On trees of polygons

DOI10.1007/BF01270490zbMath0575.05027OpenAlexW2023472511MaRDI QIDQ1063618

Chong-Yun Chao, Nian-Zu Li

Publication date: 1985

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01270490

zbMATH Keywords

chromatic polynomialn-gon-trees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs ⋮ Classes of chromatically equivalent graphs and polygon trees ⋮ The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ Chromatic polynomials of generalized trees ⋮ Chromaticity of series-parallel graphs ⋮ On the chromatic equivalence class of graphs ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ The chromatic uniqueness of \(W_{10}\)

Cites Work

• Chromatic polynomials of connected graphs
• On chromatic coefficients
• An introduction to chromatic polynomials

This page was built for publication: On trees of polygons