Facial colorings using Hall's theorem

DOI10.1016/j.ejc.2009.10.003zbMath1238.05090DBLPjournals/ejc/HavetKSS10OpenAlexW2066265919WikidataQ57601427 ScholiaQ57601427MaRDI QIDQ966152

Daniel Král', Riste Škrekovski, Frédéric Havet, Jean-Sébastien Sereni

Publication date: 27 April 2010

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

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

zbMATH Keywords

facial walk

Mathematics Subject Classification ID

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

Related Items (10)

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 ⋮ \(\ell\)-facial edge colorings of graphs ⋮ Cyclic colorings of plane graphs with independent faces ⋮ 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
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• On cyclic colorings and their generalizations
• The four-colour theorem
• Cyclic, diagonal and facial colorings
• A new bound on the cyclic chromatic number
• On vertex types and cyclic colourings of 3-connected plane graphs
• Cyclic, diagonal and facial colorings -- a missing case
• Cyclic Chromatic Number of 3-Connected Plane Graphs
• List Colouring Squares of Planar Graphs
• 3-Facial Coloring of Plane Graphs
• Cyclic coloration of 3-polytopes
• A new proof of the 6 color theorem
• 25 pretty graph colouring problems

This page was built for publication: Facial colorings using Hall's theorem