\(k\)-forested choosability of planar graphs and sparse graphs
From MaRDI portal
Publication:764887
DOI10.1016/j.disc.2011.10.031zbMath1241.05038MaRDI QIDQ764887
Xin Zhang, Gui Zhen Liu, Jian Liang Wu
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.031
05C05: Trees
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Cites Work
- \(k\)-forested coloring of planar graphs with large girth
- Frugal, acyclic and star colourings of graphs
- Linear and 2-frugal choosability of graphs of small maximum average degree
- Oriented colorings of 2-outerplanar graphs
- Linear choosability of graphs
- Linear coloring of graphs embeddable in a surface of nonnegative characteristic
- Linear coloring of planar graphs with large girth
- On acyclic colorings of planar graphs
- Colouring a graph frugally
- Linear coloring of graphs
- \(k\)-forested choosability of graphs with bounded maximum average degree
- Linear choosability of sparse 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