Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
From MaRDI portal
Publication:489724
DOI10.1007/s10878-012-9586-4zbMath1309.05058OpenAlexW2011909118MaRDI QIDQ489724
Lingji Xu, Zheng-Ke Miao, Ying Qian Wang
Publication date: 21 January 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9586-4
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable ⋮ Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable ⋮ Every planar graph with girth at least 5 is \((1,9)\)-colorable ⋮ Defective 2-colorings of planar graphs without 4-cycles and 5-cycles ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable ⋮ Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ A relaxation of Novosibirsk 3-color conjecture ⋮ A relaxation of the Bordeaux conjecture
Cites Work
