Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4656887 | Journal of Combinatorial Theory, Series B | 2014 | 32 Pages |
Abstract
A graph is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. We prove that if cycles of length at most four in a planar graph G are pairwise far apart, then G is 3-choosable. This is analogous to the problem of Havel regarding 3-colorability of planar graphs with triangles far apart.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
ZdenÄk DvoÅák,