Improved bounds for acyclic chromatic index of planar graphs
From MaRDI portal
Publication:534360
DOI10.1016/J.DAM.2010.12.019zbMATH Open1222.05035OpenAlexW2086153794MaRDI QIDQ534360FDOQ534360
Jianfeng Hou, Guizhen Liu, Guanghui 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
Recommendations
- Acyclic edge coloring of planar graphs with large girth
- An improved bound on acyclic chromatic index of planar graphs
- Acyclic chromatic indices of planar graphs with large girth
- Acyclic chromatic indices of planar graphs with girth at least five
- A new upper bound on the acyclic chromatic indices of planar graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Acyclic edge coloring of graphs with maximum degree 4
- Improved bounds on acyclic edge colouring
- Acyclic edge colorings of graphs
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Acyclic and oriented chromatic numbers of graphs
- Star coloring of graphs
- Estimation of sparse hessian matrices and graph coloring problems
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic colorings of subcubic graphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic Edge Colouring of Outerplanar Graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge chromatic number of outerplanar graphs
- Algorithmic aspects of acyclic edge colorings
Cited In (14)
- Improved upper bounds on acyclic edge colorings
- Acyclic reducible bounds for outerplanar graphs
- Improved bounds on linear coloring of plane graphs
- Acyclic edge colouring of plane graphs
- An improved bound on acyclic chromatic index of planar graphs
- Acyclic edge coloring of planar graphs with girth at least 5
- Acyclic edge coloring of planar graphs without small cycles
- Acyclic chromatic indices of planar graphs with large girth
- Improved bounds for the chromatic index of graphs and multigraphs
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
- Acyclic chromatic index of planar graphs with triangles
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic edge coloring of sparse graphs
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
This page was built for publication: Improved bounds for acyclic chromatic index of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534360)
