The following pages link to The color space of a graph (Q4500710):
Displaying 5 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)
