A note on 2-facial coloring of plane graphs

DOI10.1016/J.IPL.2006.02.013zbMath1178.05042OpenAlexW1982378541MaRDI QIDQ844207

Mickaël Montassier, Andre Raspaud

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.02.013

zbMATH Keywords

outerplanar graphsvertex coloringplane graphlarge girthcyclic coloringfacial coloringfacial walk\(K_4\)-minor free graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Wegner's conjecture on 2-distance coloring ⋮ Wegner's conjecture on 2-distance coloring for planar graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ 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 ⋮ Minimum 2-distance coloring of planar graphs and channel assignment ⋮ Injective colorings of planar graphs with few colors

Cites Work

• Unnamed Item
• On the \(d\)-distance face chromatic number of plane graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• Cyclic, diagonal and facial colorings
• A bound on the chromatic number of the square of a planar graph
• 25 pretty graph colouring problems

This page was built for publication: A note on 2-facial coloring of plane graphs