An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs

DOI10.1007/978-3-642-21204-8_17zbMath1329.05283OpenAlexW1888521704MaRDI QIDQ3004663

Edita Máčajová, Ján Mazák

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_17

Mathematics Subject Classification ID

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

Related Items (2)

Acyclic 4-edge colouring of non-regular subcubic graphs in linear time ⋮ Generalized arboricity of graphs with large girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic colorings of subcubic graphs
• Acyclic edge coloring of subcubic graphs
• Algorithmic aspects of acyclic edge colorings
• Acyclic edge colorings of graphs
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• Acyclic coloring of graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1
• Acyclic colorings of planar graphs

This page was built for publication: An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs