{
  "id": "1912.07679",
  "version": "v1",
  "published": "2019-12-16T20:13:25.000Z",
  "updated": "2019-12-16T20:13:25.000Z",
  "title": "The polynomial method for list-colouring extendability of outerplanar graphs",
  "authors": [
    "Przemysław Gordinowicz",
    "Paweł Twardowski"
  ],
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We restate theorems of Hutchinson on list-colouring extendability for outerplanar graphs in terms of non-vanishing monomials in a graph polynomial, this way obtaining Alon-Tarsi equivalent for her work. This allows to simplify the proofs as well as obtain more general results.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-12-16T20:13:25.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10",
      "05C15",
      "05C31"
    ],
    "keywords": [
      "outerplanar graphs",
      "list-colouring extendability",
      "polynomial method",
      "way obtaining alon-tarsi equivalent",
      "general results"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}