Acyclic chromatic indices of planar graphs with large girth
From MaRDI portal
Publication:2275931
DOI10.1016/j.dam.2011.03.017zbMath1223.05088OpenAlexW2080754473MaRDI QIDQ2275931
Kan Wang, Ping Wang, Qiaojun Shu, Wei Fan Wang
Publication date: 10 August 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.017
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (10)
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Acyclic edge coloring of planar graphs without 5-cycles ⋮ Acyclic edge colouring of plane graphs ⋮ Acyclic chromatic indices of planar graphs with girth at least five ⋮ Acyclic edge coloring of planar graphs without 4-cycles ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ Acyclic edge coloring of planar graphs with girth at least 5 ⋮ Acyclic edge coloring of IC-planar graphs ⋮ Acyclic edge coloring of triangle-free 1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic colorings of subcubic graphs
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- Algorithmic aspects of acyclic edge colorings
- Every planar graph has an acyclic 8-coloring
- Acyclic edge colorings of graphs
- Acyclic coloring of graphs
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic colorings of planar graphs
This page was built for publication: Acyclic chromatic indices of planar graphs with large girth