Linear coloring of planar graphs with large girth

DOI10.1016/j.disc.2008.04.032zbMath1191.05043OpenAlexW2126426226MaRDI QIDQ1045057

Wei Fan Wang, Andre Raspaud

Publication date: 15 December 2009

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

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

zbMATH Keywords

girthplanar graphmaximum degreelinear coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Linear coloring of planar graphs without 4-cycles ⋮ On linear coloring of planar graphs with small girth ⋮ Improved bounds on linear coloring of plane graphs ⋮ \(k\)-forested coloring of planar graphs with large girth ⋮ 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 ⋮ The linear \(t\)-colorings of Sierpiński-like 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
• On acyclic colorings of planar graphs
• Colouring a graph frugally
• Linear coloring of graphs
• Every planar graph has an acyclic 8-coloring
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Acyclic list 7‐coloring of planar graphs
• Acyclic colorings of planar graphs

This page was built for publication: Linear coloring of planar graphs with large girth