|
|||||
|
|
Graphs of degree 4 are 5-edge-choosable |
|
| Authors: | Martin Juvan Bojan Mohar Riste S&#x;krekovski |
| Abstract: | It is shown that every simple graph with maximal degree 4 is 5-edge-choosable. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 250–264, 1999 |
| Keywords: | graph edge coloring list coloring |