Tight relation between the circular chromatic number and the girth of series-parallel graphs

DOI10.1016/S0012-365X(01)00376-4zbMATH Open0999.05040OpenAlexW2003260136MaRDI QIDQ1613554FDOQ1613554

Authors Zhishi Pan, Xuding Zhu

Publication date 29 August 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00376-4

zbMATH Keywords

girthcircular chromatic numberseries-parallel graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(5)

• Fractional, circular, and defective coloring of series-parallel graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
• Finite duality for some minor closed classes
• Short proofs for two theorems of Chien, Hell and Zhu

This page was built for publication: Tight relation between the circular chromatic number and the girth of series-parallel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613554)