{
  "id": "2012.15100",
  "version": "v1",
  "published": "2020-12-30T10:12:43.000Z",
  "updated": "2020-12-30T10:12:43.000Z",
  "title": "Decomposing a triangle-free planar graph into a forest and a subcubic forest",
  "authors": [
    "Carl Feghali",
    "Robert Šámal"
  ],
  "comment": "7 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most $5$, showing that $5$ can be replaced by $3$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-12-30T10:12:43.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "triangle-free planar graph",
      "subcubic forest",
      "vertex set",
      "decomposing",
      "maximum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}