Title: | Planar graphs have two-coloring number at most 8 |
Authors: | Dvořák, Zdeněk Kabela, Adam Kaiser, Tomáš |
Citation: | DVOŘÁK, Z., KABELA, A., KAISER, T. Planar graphs have two-coloring number at most 8. Journal of combinatorial theory series B, 2018, roč. 130, č. MAY 2018, s. 144-157. ISSN 0095-8956 |
Issue Date: | 2018 |
Publisher: | Elsevier |
Document type: | postprint postprint |
URI: | http://hdl.handle.net/11025/29945 |
ISSN: | 0095-8956 |
Keywords in different language: | Planar graph;Two-coloring number |
Abstract in different language: | We prove that the two-coloring number of any planar graph is at most 8. This resolves a question of Kierstead et al. (2009). The result is optimal. |
Rights: | © Elsevier |
Appears in Collections: | Články / Articles (KMA) OBD |
Files in This Item:
File | Size | Format | |
---|---|---|---|
1506.01412.pdf | 168 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/29945
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.