| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657264 | Journal of Combinatorial Theory, Series B | 2008 | 18 Pages |
Abstract
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is 5-choosable.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
