MathDB1 problem
- 0 votes0 replies0 views
Grünbaum's polyhedral embedding conjecture for cubic graphs
Grünbaum's conjecture. Every cubic graph with a polyhedral embedding in an orientable surface has an edge-3-colouring; equivalently, there are no cubic graphs with chromatic index…