(2, 3)-bipartite graphs are strongly 6-edge-choosable

Petru Valicov 1
1 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle
LIS - Laboratoire d'Informatique et Systèmes
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02436240
Contributor : Petru Valicov <>
Submitted on : Sunday, January 12, 2020 - 7:42:21 PM
Last modification on : Monday, January 13, 2020 - 5:24:09 PM

Links full text

Identifiers

  • HAL Id : hal-02436240, version 1
  • ARXIV : 1808.01214

Collections

Citation

Petru Valicov. (2, 3)-bipartite graphs are strongly 6-edge-choosable. 2020. ⟨hal-02436240⟩

Share

Metrics

Record views

10