Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613)
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: Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof |
scientific article; zbMATH DE number 5802659
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof |
scientific article; zbMATH DE number 5802659 |
Statements
Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (English)
0 references
19 October 2010
0 references
edge-colouring
0 references
list-colouring
0 references
planar graph
0 references
list colouring conjecture
0 references
0 references
