Acyclic edge coloring of sparse graphs
From MaRDI portal
Publication:1759399
DOI10.1016/J.DISC.2012.08.012zbMath1270.05049OpenAlexW1978597841MaRDI QIDQ1759399
Publication date: 20 November 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.08.012
Related Items (3)
Acyclic edge coloring of graphs ⋮ The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
Cites Work
- Unnamed Item
- Unnamed Item
- Some results on acyclic edge coloring of plane graphs
- On acyclic edge coloring of planar graphs without intersecting triangles
- Improved bounds for acyclic chromatic index of planar 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
- Acyclic edge coloring of planar graphs without small cycles
- Acyclic chromatic index of planar graphs with triangles
- Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
- Acyclic edge colorings of graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic Edge Coloring of Triangle‐Free Planar Graphs
This page was built for publication: Acyclic edge coloring of sparse graphs