Pages that link to "Item:Q2371269"
From MaRDI portal
The following pages link to Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269):
Displayed 13 items.
- Steinberg's conjecture is false (Q345097) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← 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)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
