Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6302994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable |
scientific article; zbMATH DE number 6302994 |
Statements
11 June 2014
0 references
list edge coloring
0 references
0.99989367
0 references
0.9598592
0 references
0.92441237
0 references
0.89956343
0 references
0.8977856
0 references
0.8956995
0 references
0.8947052
0 references
0.8933328
0 references
