{
  "id": "1506.01412",
  "version": "v1",
  "published": "2015-06-03T21:15:37.000Z",
  "updated": "2015-06-03T21:15:37.000Z",
  "title": "Planar graphs have two-coloring number at most 8",
  "authors": [
    "Zdeněk Dvořák",
    "Adam Kabela",
    "Tomáš Kaiser"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-06-03T21:15:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C10",
      "G.2.2"
    ],
    "keywords": [
      "planar graph",
      "two-coloring number",
      "two-colouring number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150601412D"
    }
  }
}