Linear list coloring of some sparse graph
Ming Chen, Yusheng Li, Li Zhang · Discussiones Mathematicae Graph Theory · 2018
A linear k-coloring of a graph is a proper k-coloring of the graph such that any subgraph induced by the vertices of any pair of color classes is a union of vertex-disjoint paths. A graph G is linearly L-colorable if there is a linear coloring c of G for a given list assignment