5-choosability of graphs with crossings far apart
Combinatorics
2016-12-16 v3
Abstract
We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow some vertices to have lists of size four only, as long as they are far apart and far from the crossings.
Cite
@article{arxiv.1201.3014,
title = {5-choosability of graphs with crossings far apart},
author = {Zdenek Dvorak and Bernard Lidicky and Bojan Mohar},
journal= {arXiv preprint arXiv:1201.3014},
year = {2016}
}
Comments
55 pages, 11 figures; minor revision according to the referee suggestions