Planar graphs with circular chromatic numbers between 3 and 4

DOI10.1006/jctb.1999.1900zbMath0933.05053OpenAlexW2004002579MaRDI QIDQ1306306

Xuding Zhu

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1900

zbMATH Keywords

circular chromatic numberplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item ⋮ Unnamed Item ⋮ Signed planar graphs with given circular chromatic numbers ⋮ The circular chromatic number of series-parallel graphs with large girth ⋮ Circular total chromatic numbers of graphs ⋮ Some star extremal circulant graphs ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Circular chromatic number of signed graphs ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ Circular Chromatic Indices of Regular Graphs ⋮ Circular chromatic indices of even degree regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs whose circular chromatic number equals the chromatic number
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Circular chromatic numbers of Mycielski's graphs
• Star chromatic numbers of graphs
• A note on the star chromatic number
• Star chromatic number
• Star chromatic numbers and products of graphs
• On (k,d)-colorings and fractional nowhere-zero flows
• 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