{
  "id": "2011.04195",
  "version": "v1",
  "published": "2020-11-09T05:22:06.000Z",
  "updated": "2020-11-09T05:22:06.000Z",
  "title": "Stack-number is not bounded by queue-number",
  "authors": [
    "Vida Dujmović",
    "David Eppstein",
    "Robert Hickingbotham",
    "Pat Morin",
    "David R. Wood"
  ],
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We describe a family of graphs with queue-number at most 4 but unbounded stack-number. This resolves open problems of Heath, Leighton and Rosenberg (1992) and Blankenship and Oporowski (1999).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-11-09T05:22:06.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "queue-number",
      "resolves open problems",
      "unbounded stack-number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}