{
  "id": "1407.6531",
  "version": "v2",
  "published": "2014-07-24T11:24:10.000Z",
  "updated": "2014-07-25T13:44:02.000Z",
  "title": "On triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph",
  "authors": [
    "Nicolas Trotignon",
    "Kristina Vušković"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least~5 in this class is 3-colorable.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2014-07-25T13:44:02.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "complete graph",
      "triangle-free graphs",
      "induced subgraph",
      "subdivision"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1407.6531T"
    }
  }
}