On linear coloring of planar graphs with small girth
From MaRDI portal
Publication:400495
DOI10.1016/J.DAM.2014.03.019zbMATH Open1297.05082OpenAlexW2084667381MaRDI QIDQ400495FDOQ400495
Authors: Wei Dong, Wensong Lin 
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.019
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Graph theory with applications
- Acyclic colorings of planar graphs
- Linear coloring of graphs embeddable in a surface of nonnegative characteristic
- Linear coloring of planar graphs with large girth
- Colouring a graph frugally
- Linear coloring of graphs
- Upper bounds on the linear chromatic number of a graph
- Linear choosability of graphs
- Linear choosability of sparse graphs
- Linear coloring of sparse graphs
- Improved bounds on linear coloring of plane graphs
Cited In (7)
- Linear coloring of planar graphs with girth at least five
- Improved bounds on linear coloring of plane graphs
- Title not available (Why is that?)
- A Lebesgue's type theorem on toroidal graphs and its application to linear coloring
- Linear list coloring of some sparse graphs
- Linear coloring of planar graphs with large girth
- New upper bounds on linear coloring of planar graphs
This page was built for publication: On linear coloring of planar graphs with small girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400495)
