{
  "id": "1504.02122",
  "version": "v1",
  "published": "2015-04-08T20:46:49.000Z",
  "updated": "2015-04-08T20:46:49.000Z",
  "title": "On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7",
  "authors": [
    "Richard Lang"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Among other results, it is shown that 3-trees are $\\Delta$-edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are $\\Delta$-edge-choosable.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-04-08T20:46:49.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "G.2.2"
    ],
    "keywords": [
      "list chromatic index",
      "maximum degree",
      "tree-width"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150402122L"
    }
  }
}