Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices

DOI10.1016/J.IPL.2010.12.002zbMath1259.05058OpenAlexW2000814123MaRDI QIDQ1944091

Anna Fiedorowicz

Publication date: 4 April 2013

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

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

zbMATH Keywords

combinatorial problemsgraph algorithmsacyclic edge colouring

Mathematics Subject Classification ID

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

Related Items (2)

Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ Acyclic chromatic indices of fully subdivided graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Algorithmic aspects of acyclic edge colorings
• Optimal Acyclic Edge Colouring of Grid Like Graphs
• Acyclic coloring of graphs
• Acyclic Edge Colouring of Outerplanar Graphs

This page was built for publication: Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices