An improved bound on acyclic chromatic index of planar graphs
From MaRDI portal
Publication:1945955
DOI10.1016/j.disc.2013.02.002zbMath1262.05053arXiv1203.5186OpenAlexW2950821171MaRDI QIDQ1945955
Yingyuan Yang, Yue Guan, Jian-Feng Hou
Publication date: 17 April 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.5186
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
On generalized neighbor sum distinguishing index of planar graphs, Acyclic chromatic index of triangle-free 1-planar graphs, Neighbor sum distinguishing index of planar graphs, Further result on acyclic chromatic index of planar graphs, Acyclic edge coloring of graphs, Acyclic edge coloring of planar graphs with girth at least 5, Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large, Acyclic edge coloring of IC-planar graphs
Cites Work
- Unnamed Item
- Acyclic edge coloring of planar graphs without 5-cycles
- Acyclic chromatic indices of planar graphs with girth at least five
- Improved bounds for acyclic chromatic index of planar graphs
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- Acyclic chromatic index of planar graphs with triangles
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic edge coloring of graphs with maximum degree 4
- A parallel algorithmic version of the local lemma
- Optimal acyclic edge‐coloring of cubic graphs
- Acyclic Edge Coloring of Triangle‐Free Planar Graphs