Planar graphs have two-coloring number at most 8
Combinatorics
2019-10-18 v3
Abstract
We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548--1560]. The result is optimal.
Cite
@article{arxiv.1506.01412,
title = {Planar graphs have two-coloring number at most 8},
author = {Zdeněk Dvořák and Adam Kabela and Tomáš Kaiser},
journal= {arXiv preprint arXiv:1506.01412},
year = {2019}
}