Cyclic, diagonal and facial colorings

DOI10.1016/j.ejc.2004.01.016zbMath1056.05063OpenAlexW2035216045WikidataQ57601556 ScholiaQ57601556MaRDI QIDQ1767632

Riste Škrekovski, Tomáš Madaras, Daniel Král'

Publication date: 8 March 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.01.016

zbMATH Keywords

plane graphcyclic coloringsfacial colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Cyclic, diagonal and facial colorings -- a missing case ⋮ A note on 2-facial coloring of plane graphs ⋮ Third case of the cyclic coloring conjecture ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ 3-facial edge-coloring of plane graphs ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ \(\ell\)-facial edge colorings of graphs ⋮ Cyclic colorings of plane graphs with independent faces ⋮ Facial colorings using Hall's theorem ⋮ Coloring plane graphs with independent crossings ⋮ Third Case of the Cyclic Coloring Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic coloring of plane graphs
• On cyclic colorings and their generalizations
• On the \(d\)-distance face chromatic number of plane graphs
• The four-colour theorem
• On \(d\)-diagonal colorings of embedded graphs of low maximum face size
• A new bound on the cyclic chromatic number
• On vertex types and cyclic colourings of 3-connected plane graphs
• Cyclic Chromatic Number of 3-Connected Plane Graphs
• Cyclic coloration of 3-polytopes
• Every Planar Map is Four Colorable
• A new proof of the 6 color theorem
• On some properties of 4‐regular plane graphs
• Ond-diagonal colorings
• 25 pretty graph colouring problems