Ringel–Youngs theorem (Q6481569)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: [[]] |
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
HeawoodConjecture
Heawood Conjecture
1 reference
2779718775
0 references
/m/05dflx
0 references
