\(k\)-forested coloring of planar graphs with large girth
From MaRDI portal
Publication:632996
DOI10.3792/pjaa.86.169zbMath1208.05022MaRDI QIDQ632996
Xin Zhang, Gui Zhen Liu, Jian Liang Wu
Publication date: 29 March 2011
Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3792/pjaa.86.169
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- Unnamed Item
- Linear choosability of graphs
- Linear coloring of planar graphs with large girth
- On acyclic colorings of planar graphs
- Colouring a graph frugally
- Linear coloring of graphs
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- Estimation of sparse hessian matrices and graph coloring problems
- Acyclic Colourings of Planar Graphs with Large Girth
- Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic colorings of planar graphs