Skip to Main content Skip to Navigation
Conference papers

Linear choosability of graphs

Abstract : A proper vertex coloring of a non oriented graph $G=(V,E)$ is linear if the graph induced by the vertices of two color classes is a forest of paths. A graph $G$ is $L$-list colorable if for a given list assignment $L=\{L(v): v∈V\}$, there exists a proper coloring $c$ of $G$ such that $c(v)∈L(v)$ for all $v∈V$. If $G$ is $L$-list colorable for every list assignment with $|L(v)|≥k$ for all $v∈V$, then $G$ is said $k$-choosable. A graph is said to be lineary $k$-choosable if the coloring obtained is linear. In this paper, we investigate the linear choosability of graphs for some families of graphs: graphs with small maximum degree, with given maximum average degree, planar graphs... Moreover, we prove that determining whether a bipartite subcubic planar graph is lineary 3-colorable is an NP-complete problem.
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, August 14, 2015 - 11:39:17 AM
Last modification on : Monday, December 20, 2021 - 4:50:12 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:06:19 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01184391, version 1



Louis Esperet, Mickael Montassier, André Raspaud. Linear choosability of graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.99-104. ⟨hal-01184391⟩



Les métriques sont temporairement indisponibles