Chromaticity of series-parallel graphs

DOI10.1016/0012-365X(94)00355-MzbMath0856.05035OpenAlexW1970753020MaRDI QIDQ1918563

C. P. Teo, Khee Meng Koh

Publication date: 18 July 1996

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

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

zbMATH Keywords

chromatic polynomialseries-parallel graphchromatic invariantsgeneralised polygon tree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ On minimum average stretch spanning trees in polygonal 2-trees

Cites Work

• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• On trees of polygons
• Chromatic polynomials of generalized trees
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Classes of chromatically equivalent graphs and polygon trees
• The chromaticity of \(s\)-bridge graphs and related graphs
• Topology of series-parallel networks
• Chromatic polynomials, polygon trees, and outerplanar graphs
• On chromatic equivalence of graphs
• An introduction to chromatic polynomials
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Chromaticity of series-parallel graphs