HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Linear and 2-frugal choosability of graphs of small maximum average degree

Nathann Cohen 1 Frédéric Havet 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : A proper vertex colouring of a graph $G$ is {\it 2-frugal} (resp. {\it linear}) if the graph induced by the vertices of any two colour classes is of maximum degree 2 (resp. is a forest of paths). A graph $G$ is {\it 2-frugally} (resp. {\it linearly}) {\it $L$-colourable} if for a given list assignment $L:V(G)\mapsto 2^{\mathbb N}$, there exists a 2-frugal (resp. linear) colouring $c$ of $G$ such that $c(v)\in L(v)$ for all $v\in V(G)$. If $G$ is 2-frugally (resp. linearly) $L$-list colourable for any list assignment such that $|L(v)|\ge k$ for all $v\inV(G)$, then $G$ is {\it 2-frugally} (resp. {\it linearly}) {\it $k$-choosable}. In this paper, we improve some bounds on the 2-frugal choosability and linear choosability of graphs with small maximum average degree.
Document type :
Complete list of metadata

Contributor : Nathann Cohen Connect in order to contact the contributor
Submitted on : Wednesday, February 24, 2010 - 5:00:51 PM
Last modification on : Friday, February 4, 2022 - 3:20:12 AM
Long-term archiving on: : Thursday, October 18, 2012 - 3:45:47 PM


Files produced by the author(s)


  • HAL Id : inria-00459692, version 1


Nathann Cohen, Frédéric Havet. Linear and 2-frugal choosability of graphs of small maximum average degree. [Research Report] RR-7213, INRIA. 2010. ⟨inria-00459692⟩



Record views


Files downloads