Improved bounds on linear coloring of plane graphs
From MaRDI portal
Publication:625757
DOI10.1007/s11425-010-3073-0zbMath1210.05038OpenAlexW2133650413MaRDI QIDQ625757
Wei Dong, Xiaoyan Zhang, Bao-Gang Xu
Publication date: 25 February 2011
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-010-3073-0
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (6)
On linear coloring of planar graphs with small girth ⋮ Linear coloring of sparse graphs ⋮ Linear list coloring of some sparse graphs ⋮ A result on linear coloring of planar graphs ⋮ Linear colorings of subcubic graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs
Cites Work
- Unnamed Item
- Generalised acyclic edge colourings of graphs with large girth
- On the adjacent-vertex-strongly-distinguishing total coloring of graphs
- Linear choosability of graphs
- Acyclic edge coloring of subcubic graphs
- Linear coloring of graphs embeddable in a surface of nonnegative characteristic
- Acyclic edge colorings of planar graphs and series parallel graphs
- Linear coloring of planar graphs with large girth
- On acyclic colorings of planar graphs
- Colouring a graph frugally
- Algorithmic aspects of acyclic edge colorings
- Linear coloring of graphs
- Every planar graph has an acyclic 8-coloring
- On adjacent-vertex-distinguishing total coloring of graphs
- Acyclic coloring of graphs
- Acyclic list 7‐coloring of planar graphs
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic colorings of planar graphs
This page was built for publication: Improved bounds on linear coloring of plane graphs
