Q2799491

From Wikidata
Jump to: navigation, search

Ringel–Youngs theorem (Q2799491)[edit]

theorem on the number of colors needed for graphs embedded on higher genus surfaces [edit]

Also known as:
  • Heawood conjecture
[edit]

Statements