| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903870 | Journal of Combinatorial Theory, Series B | 2018 | 14 Pages |
Abstract
We prove that the two-coloring number of any planar graph is at most 8. This resolves a question of Kierstead et al. (2009) [3]. The result is optimal.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
ZdenÄk DvoÅák, Adam Kabela, TomáÅ¡ Kaiser,