{
  "id": "1205.3253",
  "version": "v5",
  "published": "2012-05-15T04:18:35.000Z",
  "updated": "2013-06-25T01:51:39.000Z",
  "title": "A different short proof of Brooks' theorem",
  "authors": [
    "Landon Rabern"
  ],
  "comment": "added cute Kernel Lemma trick to lift up to (online) list coloring",
  "categories": [
    "math.CO"
  ],
  "abstract": "Lov\\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.",
  "revisions": [
    {
      "version": "v5",
      "updated": "2013-06-25T01:51:39.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "short proof",
      "lovasz gave",
      "cubic case",
      "kernel lemma"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1205.3253R"
    }
  }
}