Campus Units

Mathematics

Document Type

Article

Publication Version

Submitted Manuscript

Publication Date

3-2017

Journal or Book Title

Journal of Combinatorial Theory, Series B

Volume

123

First Page

54

Last Page

96

DOI

10.1016/j.jctb.2016.11.004

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.

Comments

This is a manuscripts of an article published as Dvořák, Zdeněk, Bernard Lidický, and Bojan Mohar. "5-choosability of graphs with crossings far apart." Journal of Combinatorial Theory, Series B 123 (2017): 54-96. 10.1016/j.jctb.2016.11.004 Posted with permission.

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Copyright Owner

Elsevier Inc.

Language

en

File Format

application/pdf

Published Version

Share

COinS