Analysis of a heuristic for acyclic edge colouring

DOI10.1016/j.ipl.2006.05.001zbMath1184.05051OpenAlexW1995762848MaRDI QIDQ845729

C. R. Subramanian

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.001

zbMATH Keywords

analysis of algorithmsacyclic edge colouring

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices ⋮ On acyclic edge coloring of toroidal graphs ⋮ Acyclic chromatic indices of fully subdivided graphs ⋮ Optimal acyclic edge colouring of grid like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic colorings of subcubic graphs
• Algorithmic aspects of acyclic edge colorings
• Acyclic and oriented chromatic numbers of graphs
• Optimal Acyclic Edge Colouring of Grid Like Graphs
• Acyclic coloring of graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1
• Acyclic colorings of planar graphs
• All-to-all wavelength-routing in all-optical compound networks

This page was built for publication: Analysis of a heuristic for acyclic edge colouring