Petru Valicov
Published 2018-08-03Version 1
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.
Comments: 5 pages; 2 figures
Subdivisions of vertex-disjoint cycles in bipartite graphs
Bipartite graphs are weak antimagic
On the number of spanning trees in bipartite graphs
![QR code for arXiv:1808.01214 [math.CO]](http://oss.arxitics.com/images/favicon.svg)