Pages that link to "Item:Q5189509"
From MaRDI portal
The following pages link to On $(3,1)^*$-Coloring of Plane Graphs (Q5189509):
Displaying 27 items.
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 (Q394211) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724) (← links)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
- A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- Relaxed equitable colorings of planar graphs with girth at least 8 (Q2305904) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954) (← links)
- Improper colorability of planar graphs without prescribed short cycles (Q2436833) (← links)
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (Q2449153) (← links)
- Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable (Q2449160) (← links)
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS (Q3397518) (← links)
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)