Pages that link to "Item:Q709301"
From MaRDI portal
The following pages link to Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301):
Displayed 14 items.
- Steinberg's conjecture is false (Q345097) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← 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)
- A refinement of choosability of graphs (Q2284741) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
- Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)