Ringel–Youngs theorem (Q2799491)

From Wikidata
Jump to: navigation, search
theorem on the number of colors needed for graphs embedded on higher genus surfaces
  • Heawood conjecture
[edit]
Language Label Description Also known as
English
Ringel–Youngs theorem
theorem on the number of colors needed for graphs embedded on higher genus surfaces
  • Heawood conjecture

Statements

0 references
0 references
[edit]
[edit]
[edit]
[edit]
[edit]
[edit]