Note on list star edge‐coloring of subcubic graphs
Borut Lužar, Martina Mockovčiaková, Roman Soták · Journal of Graph Theory · 2018
Abstract A star edge‐coloring of a graph is a proper edge‐coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of this coloring and prove that the list star chromatic index of every subcubic graph is at most 7, answering the question of Dvořák et al (J Graph Theory, 72 (2013), 313‐326).