Ringel–Youngs theorem (Q2799491)
Jump to navigation
Jump to search
theorem on the number of colors needed for graphs embedded on higher genus surfaces
- Heawood conjecture
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ringel–Youngs theorem |
theorem on the number of colors needed for graphs embedded on higher genus surfaces |
|
Statements
Identifiers
Sitelinks
Wikipedia(6 entries)
- cawiki Conjectura de Heawood
- dewiki Satz von Ringel-Youngs
- enwiki Heawood conjecture
- frwiki Conjecture de Heawood
- ruwiki Гипотеза Хивуда
- zhwiki 曲面染色