Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.07.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977492660 / rank | |||
Normal rank | |||
Revision as of 03:30, 20 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
