Third case of the cyclic coloring conjecture

DOI10.1016/j.endm.2015.06.003zbMath1346.05070arXiv1501.06624OpenAlexW1564998533WikidataQ57601341 ScholiaQ57601341MaRDI QIDQ322178

Michael Hebdige, Daniel Král'

Publication date: 14 October 2016

Full work available at URL: https://arxiv.org/abs/1501.06624

zbMATH Keywords

graph coloringplanar graphscyclic coloringfacial coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Facial colorings using Hall's theorem
• Cyclic coloring of plane graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• On cyclic colorings and their generalizations
• Cyclic, diagonal and facial colorings
• A new bound on the cyclic chromatic number
• Colorings of plane graphs: a survey
• On vertex types and cyclic colourings of 3-connected plane graphs
• Cyclic, diagonal and facial colorings -- a missing case
• A unified approach to distance-two colouring of graphs on surfaces
• Cyclic Chromatic Number of 3-Connected Plane Graphs
• 3-Facial Coloring of Plane Graphs
• Cyclic coloration of 3-polytopes
• A new proof of the 6 color theorem

This page was built for publication: Third case of the cyclic coloring conjecture