"000328235500002" . . . "1"^^ . . "1"^^ . "3-choosability of planar graphs with ({= 4)-cycles far apart"@en . . "3-choosability of planar graphs with ({= 4)-cycles far apart" . "Journal of Combinatorial Theory. Series B" . "0095-8956" . . "http://dx.doi.org/10.1016/j.jctb.2013.10.004" . . . "leden" . "58201" . . "Dvo\u0159\u00E1k, Zden\u011Bk" . "RIV/00216208:11320/14:10283290" . . "List coloring; Planar graphs"@en . . "104" . "32"^^ . . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . "3-choosability of planar graphs with ({= 4)-cycles far apart" . . "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." . "10.1016/j.jctb.2013.10.004" . "[AF3AEC95BA47]" . "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."@en . "11320" . . "P(1M0545), P(GA201/09/0197)" . . . "RIV/00216208:11320/14:10283290!RIV15-MSM-11320___" . "3-choosability of planar graphs with ({= 4)-cycles far apart"@en .