### Abstract

A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induces a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and every assignment of lists of size four to the vertices of the graph, there exists a linear coloring such that the color of each vertex belongs to the list assigned to that vertex and the neighbors of every degree-two vertex receive different colors, unless the graph is _{C5} or _{K3,3}. This confirms a conjecture raised by Esperet, Montassier and Raspaud [L.Esperet, M.Montassier, and A. Raspaud, Linear choosability of graphs, Discrete Math. 308 (2008) 3938-3950]. Our proof is constructive and yields a linear-time algorithm to find such a coloring.

Original language | English (US) |
---|---|

Pages (from-to) | 1040-1050 |

Number of pages | 11 |

Journal | European Journal of Combinatorics |

Volume | 34 |

Issue number | 6 |

DOIs | |

State | Published - Aug 1 2013 |

### All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Linear colorings of subcubic graphs'. Together they form a unique fingerprint.

## Cite this

*European Journal of Combinatorics*,

*34*(6), 1040-1050. https://doi.org/10.1016/j.ejc.2013.02.008