Ringel–Youngs theorem
Sign in to saveAlso known as Heawood conjecture
theorem on the number of colors needed for graphs embedded on higher genus surfaces
Also known as Heawood conjecture
theorem on the number of colors needed for graphs embedded on higher genus surfaces