{
  "id": "2005.14111",
  "version": "v1",
  "published": "2020-05-28T16:06:02.000Z",
  "updated": "2020-05-28T16:06:02.000Z",
  "title": "Planar Graphs that Need Four Pages",
  "authors": [
    "Mihalis Yannakakis"
  ],
  "comment": "To be published in Journal of Combinatorial Theory, Series B",
  "categories": [
    "math.CO",
    "cs.DM",
    "cs.DS"
  ],
  "abstract": "We show that there are planar graphs that require four pages in any book embedding.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-05-28T16:06:02.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "planar graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}