Linear choosability of graphs

DOI10.1016/J.DISC.2007.07.112MaRDI QIDQ932648zbMATH OpenOpenAlexFDO

Authors L. Esperet, Mickaël Montassier, André 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)

Recommendations

• Linear choosability of graphs
• Linear list coloring of some sparse graphs
• Linear colorings of subcubic graphs
• Linear choosability of sparse graphs
• Linear list colorings of graphs with maximum average degrees bounded.

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• A bound on the chromatic number of the square of a planar graph
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs
• Acyclic list 7‐coloring of planar graphs
• Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation (extended abstract)
• Coloring the square of a planar graph
• Colouring a graph frugally
• Graph colorings with local constraints -- a survey
• Linear coloring of graphs
• List Improper Colourings of Planar Graphs
• Minimum partition of a matroid into independent subsets
• Multicriterial graph problems with MAXMIN criterion
• Some simplified NP-complete graph problems

Cited in

(20)

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

This page was built for publication: Linear choosability of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932648)