The following pages link to The color space of a graph (Q4500710):
Displaying 12 items.
- What is on his mind? (Q709300) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Adynamic coloring of graphs (Q777385) (← links)
- Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
- Graphs with full rank 3-color matrix and few 3-colorings (Q947734) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles (Q2099419) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
