Linear choosability of graphs

DOI10.1016/j.disc.2007.07.112zbMath1203.05054OpenAlexW2005086949MaRDI QIDQ932648

Mickaël Montassier, Louis Esperet, Andre Raspaud

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.112

zbMATH Keywords

graph coloringchoosability under constraints

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Linear coloring of planar graphs without 4-cycles ⋮ Linear list r-hued coloring of sparse graphs ⋮ On linear coloring of planar graphs with small girth ⋮ Linear coloring of sparse graphs ⋮ Improved bounds on linear coloring of plane graphs ⋮ Upper bounds on the linear chromatic number of a graph ⋮ \(k\)-forested coloring of planar graphs with large girth ⋮ Frugal, acyclic and star colourings of graphs ⋮ Linear list coloring of some sparse graphs ⋮ A result on linear coloring of planar graphs ⋮ Linear colorings of subcubic graphs ⋮ Linear and 2-frugal choosability of graphs of small maximum average degree ⋮ New upper bounds on linear coloring of planar graphs ⋮ Linear choosability of sparse graphs ⋮ \(k\)-forested choosability of planar graphs and sparse graphs ⋮ Linear coloring of graphs embeddable in a surface of nonnegative characteristic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• Colouring a graph frugally
• Linear coloring of graphs
• A bound on the chromatic number of the square of a planar graph
• Acyclic coloring of graphs
• Graph colorings with local constraints -- a survey
• List Improper Colourings of Planar Graphs
• Acyclic list 7‐coloring of planar graphs
• Coloring the square of a planar graph
• Minimum partition of a matroid into independent subsets
• Graph-Theoretic Concepts in Computer Science
• Acyclic colorings of planar graphs

This page was built for publication: Linear choosability of graphs