Improved bounds for acyclic chromatic index of planar graphs
From MaRDI portal
Publication:534360
DOI10.1016/J.DAM.2010.12.019zbMath1222.05035OpenAlexW2086153794MaRDI QIDQ534360
Jian-Feng Hou, Gui Zhen Liu, Guang-Hui Wang
Publication date: 17 May 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.019
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Acyclic edge coloring of planar graphs without small cycles ⋮ Acyclic chromatic index of planar graphs with triangles ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Acyclic edge colouring of plane graphs ⋮ Acyclic edge coloring of planar graphs with girth at least 5 ⋮ Acyclic edge coloring of sparse graphs
Cites Work
- Unnamed Item
- Acyclic colorings of subcubic graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Algorithmic aspects of acyclic edge colorings
- Improved bounds on acyclic edge colouring
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic and oriented chromatic numbers of graphs
- Star coloring of graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Estimation of sparse hessian matrices and graph coloring problems
- Acyclic coloring of graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic Edge Colouring of Outerplanar Graphs
This page was built for publication: Improved bounds for acyclic chromatic index of planar graphs