Planar graphs are \(9/2\)-colorable
From MaRDI portal
Publication:1791701
DOI10.1016/j.jctb.2018.04.002zbMath1397.05061arXiv1410.7233OpenAlexW2963971110MaRDI QIDQ1791701
Landon Rabern, Daniel W. Cranston
Publication date: 11 October 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.7233
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Every planar graph is 1-defective \((9,2)\)-paintable ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs have independence ratio at least 3/13
- Kneser's conjecture, chromatic number, and homotopy
- \(K_{5}\)-free bound for the class of planar graphs
- A lower bound for the independence number of a planar graph
- Folding
- Über eine Eigenschaft der ebenen Komplexe
- A Generalization of the 5-Color Theorem
- A (<5)-Colour Theorem for Planar Graphs
- Hedetniemi's conjecture---a survey
This page was built for publication: Planar graphs are \(9/2\)-colorable
