Linear coloring of graphs

DOI10.1016/S0012-365X(97)00209-4zbMath0956.05046OpenAlexW2028427262MaRDI QIDQ1584255

Raphael Yuster

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00209-4

zbMATH Keywords

linear coloringlinear chromatic numberproper vertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (23)

Linear coloring of planar graphs without 4-cycles ⋮ Linear list r-hued coloring of sparse graphs ⋮ Graph theoretic algorithm for automatic operation sequencing for progressive die design ⋮ 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 ⋮ Linear choosability of graphs ⋮ New upper bounds on linear coloring of planar graphs ⋮ Asymptotically optimal frugal colouring ⋮ \(\mathcal Q\)-Ramsey classes of graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Entropy compression versus Lovász local lemma ⋮ 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 ⋮ Linear coloring of planar graphs with large girth

Cites Work

• Unnamed Item
• Unnamed Item
• Colouring a graph frugally
• Acyclic coloring of graphs

This page was built for publication: Linear coloring of graphs