Graphs of degree 4 are 5-edge-choosable (Q4718735)
From MaRDI portal
!
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 1382612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs of degree 4 are 5-edge-choosable |
scientific article; zbMATH DE number 1382612 |
Statements
9 April 2000
0 references
list assignment
0 references
list coloring
0 references
\(L\)-edge-colorable
0 references
\(k\)-edge-choosable
0 references
Graphs of degree 4 are 5-edge-choosable (English)
0 references
0.8738208
0 references
0.8737416
0 references
0.86948407
0 references
0.86593205
0 references
0.8621014
0 references
0.86176085
0 references
0.8616676
0 references
0 references
0.8614532
0 references
0.8612949
0 references
