List 2-facial 5-colorability of plane graphs with girth at least 12
From MaRDI portal
Publication:658054
DOI10.1016/j.disc.2011.09.018zbMath1233.05098MaRDI QIDQ658054
Oleg V. Borodin, Anna O. Ivanova
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.018
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4, 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10, Graph \(r\)-hued colorings -- a survey, A survey on the cyclic coloring and its relaxations, \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\), Facially-constrained colorings of plane graphs: a survey, Exact square coloring of subcubic planar graphs, Coloring squares of planar graphs with maximum degree at most five
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on 2-facial coloring of plane graphs
- Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- Choosability of the square of planar subcubic graphs with large girth
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- On cyclic colorings and their generalizations
- Cyclic, diagonal and facial colorings
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- Coloring squares of planar graphs with girth six
- Circular \((5,2)\)-coloring of sparse graphs
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- 2-distance 4-colorability of planar subcubic graphs with girth at least 22
- Oriented 5-coloring of sparse plane graphs
- List-Coloring Squares of Sparse Subcubic Graphs
- Every planar map is four colorable
- A new proof of the 6 color theorem
