On $(3,1)^*$-Coloring of Plane Graphs
From MaRDI portal
Publication:5189509
DOI10.1137/06066093XzbMath1221.05167MaRDI QIDQ5189509
Publication date: 17 March 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (27)
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 ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable ⋮ (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-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 ⋮ Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 ⋮ Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable ⋮ Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ 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 ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS ⋮ Equitable defective coloring of sparse planar graphs ⋮ \((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: On $(3,1)^*$-Coloring of Plane Graphs
