Acyclic edge coloring of planar graphs with girth at least 5
From MaRDI portal
Publication:2446889
DOI10.1016/j.dam.2013.06.013zbMath1287.05045OpenAlexW2076559092MaRDI QIDQ2446889
Xiaoran Zhang, Weitao Wang, Jian-Feng Hou
Publication date: 23 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.013
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Acyclic edge coloring of IC-planar graphs ⋮ Edge-colouring of graphs and hereditary graph properties
Cites Work
- Unnamed Item
- Some results on acyclic edge coloring of plane graphs
- Acyclic edge coloring of planar graphs without 5-cycles
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors
- Improved bounds for acyclic chromatic index of planar graphs
- Acyclic edge colouring of planar graphs without short cycles
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Acyclic chromatic index of planar graphs with triangles
- An improved bound on acyclic chromatic index of planar graphs
- Acyclic chromatic indices of planar graphs with large girth
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic and oriented chromatic numbers of graphs
- Star coloring of graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Estimation of sparse hessian matrices and graph coloring problems
- A parallel algorithmic version of the local lemma
- Optimal acyclic edge‐coloring of cubic graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
This page was built for publication: Acyclic edge coloring of planar graphs with girth at least 5
