(2, 3)-bipartite graphs are strongly 6-edge-choosable
Combinatorics
2018-08-06 v1
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.
Keywords
Cite
@article{arxiv.1808.01214,
title = {(2, 3)-bipartite graphs are strongly 6-edge-choosable},
author = {Petru Valicov},
journal= {arXiv preprint arXiv:1808.01214},
year = {2018}
}
Comments
5 pages; 2 figures