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

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200004)33:4<185::AID-JGT1>3.0.CO;2-N" /><185::AID-JGT1>3.0.CO;2-N 10.1002/(SICI)1097-0118(200004)33:4<185::AID-JGT1>3.0.CO;2-NzbMath0944.05038OpenAlexW4240126258MaRDI QIDQ4948748

Xuding Zhu, Chihyun Chien

Publication date: 15 September 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200004)33:4<185::aid-jgt1>3.0.co;2-n

zbMATH Keywords

circular chromatic numberseries-parallel graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Short proofs for two theorems of Chien, Hell and Zhu

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Girth in graphs
• Planar graphs with circular chromatic numbers between 3 and 4
• Star chromatic numbers of graphs
• Graph Theory and Probability
• A note on the star chromatic number
• Star chromatic number
• Star chromatic numbers and products of graphs
• The star chromatic number of a graph
• Circular colouring and graph homomorphism
• A simple proof of Moser's theorem
• Acyclic graph coloring and the complexity of the star chromatic number
• The star-chromatic number of planar graphs

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