(2, 3)-bipartite graphs are strongly 6-edge-choosable
Abstract
Kang and Park recently showed that every cubic (loopless) multigraph is incidence 6-choosable [On incidence choosability of cubic graphs. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.