Acyclic chromatic indices of fully subdivided graphs
From MaRDI portal
Publication:436602
DOI10.1016/j.ipl.2012.04.004zbMath1243.05081OpenAlexW2029240401MaRDI QIDQ436602
Mariusz Hałuszczak, Anna Fiedorowicz
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.004
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on acyclic edge coloring of plane graphs
- Acyclic edge colouring of plane graphs
- Optimal acyclic edge colouring of grid like graphs
- Acyclic colorings of subcubic graphs
- Analysis of a heuristic for acyclic edge colouring
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Algorithmic aspects of acyclic edge colorings
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic coloring of graphs
- Acyclic Edge Colouring of Outerplanar Graphs
This page was built for publication: Acyclic chromatic indices of fully subdivided graphs