Linear coloring of planar graphs with large girth

DOI10.1016/J.DISC.2008.04.032MaRDI QIDQ1045057zbMATH OpenOpenAlexFDO

Authors André Raspaud, Weifan Wang

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

girthlinear coloringmaximum degreeplanar graph

Mathematics Subject Classification ID

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

Recommendations

• New upper bounds on linear coloring of planar graphs
• Linear coloring of planar graphs with girth at least five
• On linear coloring of planar graphs with small girth
• scientific article; zbMATH DE number 5952407
• A result on linear coloring of planar graphs

Cites work

• Acyclic colorings of planar graphs
• Acyclic list 7‐coloring of planar graphs
• Colouring a graph frugally
• Every planar graph has an acyclic 8-coloring
• scientific article; zbMATH DE number 3639666 (Why is no real title available?)
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Linear choosability of graphs
• Linear coloring of graphs
• On acyclic colorings of planar graphs

Cited in

(17)

• Linear coloring of graphs embeddable in a surface of nonnegative characteristic
• New upper bounds on linear coloring of planar graphs
• The linear \(t\)-colorings of Sierpiński-like graphs
• Linear choosability of sparse graphs
• Linear colorings of subcubic graphs
• Linear coloring of planar graphs without 3-cycles
• Linear coloring of planar graphs with girth at least five
• scientific article; zbMATH DE number 5952407 (Why is no real title available?)
• Linear coloring of planar graphs without 4-cycles
• On linear coloring of planar graphs with small girth
• A result on linear coloring of planar graphs
• A Lebesgue's type theorem on toroidal graphs and its application to linear coloring
• 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
• Linear and 2-frugal choosability of graphs of small maximum average degree
• \(k\)-forested choosability of planar graphs and sparse graphs

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

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