A note on 2-facial coloring of plane graphs
DOI10.1016/J.IPL.2006.02.013zbMATH Open1178.05042OpenAlexW1982378541MaRDI QIDQ844207FDOQ844207
Authors: Mickaël Montassier, André 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
Recommendations
plane graphvertex coloringouterplanar graphslarge girthcyclic coloringfacial coloringfacial walk\(K_4\)-minor free graphs
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (15)
- A note on face coloring entire weightings of plane graphs
- A survey on the cyclic coloring and its relaxations
- 3-Facial Coloring of Plane Graphs
- Wegner's conjecture on 2-distance coloring for planar graphs
- Minimum 2-distance coloring of planar graphs and channel assignment
- Facially-constrained colorings of plane graphs: a survey
- A Frameless 2-Coloring of the Plane Lattice
- Wegner's conjecture on 2-distance coloring
- Face 2-Colorable Embeddings with Faces of Specified Lengths
- \(\ell\)-facial edge colorings of graphs
- Colorings of plane graphs without long monochromatic facial paths
- Facial graceful coloring of plane graphs
- Injective colorings of planar graphs with few colors
- List 2-facial 5-colorability of plane graphs with girth at least 12
- 2-facial 4-coloring of planar graphs with girth at least 22
This page was built for publication: A note on 2-facial coloring of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844207)