The following pages link to (Q4374713):
Displayed 8 items.
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 (Q394211) (← 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)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
- A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)