The following pages link to (Q4797465):
Displaying 9 items.
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Extending partial 3-colourings in a planar graph (Q1400956) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\) (Q2577175) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- The color space of a graph (Q4500710) (← links)
