Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:02, 5 March 2024
scientific article
| 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 |
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
