Graphs with two crossings are 5-choosable
Combinatorics
2018-10-26 v1
Abstract
A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with at most two crossings is 5-choosable.
Keywords
Cite
@article{arxiv.1103.1801,
title = {Graphs with two crossings are 5-choosable},
author = {Zdeněk Dvořák and Bernard Lidický and Riste Škrekovski},
journal= {arXiv preprint arXiv:1103.1801},
year = {2018}
}
Comments
12 pages, 4 figures