The following pages link to (Q4812233):
Displayed 7 items.
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)