{
  "id": "1808.01214",
  "version": "v1",
  "published": "2018-08-03T14:50:03.000Z",
  "updated": "2018-08-03T14:50:03.000Z",
  "title": "(2, 3)-bipartite graphs are strongly 6-edge-choosable",
  "authors": [
    "Petru Valicov"
  ],
  "comment": "5 pages; 2 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "Kang and Park recently showed that every cubic (loopless) multigraph is incidence 6-choosable [On incidence choosability of cubic graphs. \\emph{arXiv}, April 2018]. Equivalently, every bipartite graph obtained by subdividing once every edge of a cubic graph, is strongly 6-edge-choosable. The aim of this note is to give a shorter proof of their result by looking at the strong edge-coloring formulation of the problem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-08-03T14:50:03.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "cubic graph",
      "incidence choosability",
      "bipartite graph",
      "shorter proof",
      "strong edge-coloring formulation"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 5,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}