Linear List Coloring of Some Sparse Graphs
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 L = {L(v) : v ∈ V (G)...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2021-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2169 |