A new bound on the cyclic chromatic number

DOI10.1006/jctb.2001.2046zbMath1027.05044OpenAlexW2008666375MaRDI QIDQ1850557

Yue Zhao, Daniel P. Sanders

Publication date: 10 December 2002

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

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

zbMATH Keywords

angular coloringface coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (21)

Third case of the cyclic coloring conjecture ⋮ Cyclic 4-Colorings of Graphs on Surfaces ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ Facial rainbow edge-coloring of plane graphs ⋮ Parity vertex colouring of plane graphs ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ Cyclic colorings of plane graphs with independent faces ⋮ Another step towards proving a conjecture by Plummer and Toft ⋮ Facial colorings using Hall's theorem ⋮ A bound on the chromatic number of the square of a planar graph ⋮ Cyclic, diagonal and facial colorings ⋮ Coloring plane graphs with independent crossings ⋮ Third Case of the Cyclic Coloring Conjecture ⋮ Facial rainbow coloring of plane graphs ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ Facial Nonrepetitive Vertex Coloring of Plane Graphs ⋮ Coloring the faces of convex polyhedra so that like colors are far apart

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every planar map is four colorable. I: Discharging
• On cyclic colorings and their generalizations
• The four-colour theorem

This page was built for publication: A new bound on the cyclic chromatic number