The circular chromatic number of series-parallel graphs of large odd girth

DOI10.1016/S0012-365X(01)00144-3zbMath0993.05076OpenAlexW2060050269WikidataQ114122961 ScholiaQ114122961MaRDI QIDQ1348125

Xuding Zhu, Zhishi Pan

Publication date: 15 May 2002

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

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

zbMATH Keywords

circular chromatic numberseries-parallel graphodd girth

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Fractional, Circular, and Defective Coloring of Series-Parallel Graphs ⋮ Graphs with bounded tree-width and large odd-girth are almost bipartite ⋮ The circular chromatic number of signed series-parallel graphs of given girth ⋮ On the adaptable chromatic number of graphs ⋮ Extended double covers and homomorphism bounds of signed graphs ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs ⋮ Circular chromatic number of signed graphs ⋮ Short proofs for two theorems of Chien, Hell and Zhu ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ Properties of an Approximability-related Parameter on Circular Complete Graphs

This page was built for publication: The circular chromatic number of series-parallel graphs of large odd girth