A relaxation of Havel's 3-color problem
From MaRDI portal
Publication:963412
DOI10.1016/j.ipl.2008.02.003zbMath1185.05062MaRDI QIDQ963412
Mickaël Montassier, Ying Qian Wang, Wei Fan Wang, Andre Raspaud
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.003
68W05: Nonnumerical algorithms
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C12: Distance in graphs
Related Items
Distance constraints on short cycles for 3-colorability of planar graphs, Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable, Planar graphs without adjacent cycles of length at most seven are 3-colorable, A note on 3-choosability of plane graphs under distance restrictions
Cites Work