The \(r\)-acyclic chromatic number of planar graphs
From MaRDI portal
Publication:2343993
DOI10.1007/s10878-013-9619-7zbMath1321.90147OpenAlexW2007658656MaRDI QIDQ2343993
Jiguo Yu, Xin Zhang, Guang-Hui Wang, Gui Ying Yan
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9619-7
Related Items (3)
Minimum total coloring of planar graph ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ Coloring graphs without bichromatic cycles or paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(r\)-acyclic edge colorings of planar graphs
- Acyclic colorings of subcubic graphs
- On acyclic colorings of planar graphs
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Topology of series-parallel networks
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- Acyclic Vertex Coloring of Graphs of Maximum Degree Six
- Graphs with maximum degree 5 are acyclically 7-colorable
- Acyclic coloring of graphs
- Coloring Powers of Planar Graphs
- Acyclic colorings of planar graphs
This page was built for publication: The \(r\)-acyclic chromatic number of planar graphs