2018/08/03 by Petru Valicov, Valicov, Petru
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1808.01214
openalex publication_date 2018/08/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.