A Relaxation of Steinberg's Conjecture

DOI10.1137/120888752zbMath1268.05074arXiv1208.3395OpenAlexW2031630984WikidataQ122902541 ScholiaQ122902541MaRDI QIDQ5300514

Gexin Yu, Owen Hill

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.3395

zbMATH Keywords

planar graphsSteinberg's conjecturerelaxed coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

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 ⋮ 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 ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ 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 ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,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

This page was built for publication: A Relaxation of Steinberg's Conjecture