An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs [chapter]

Edita Máčajová, Ján Mazák
2011 Lecture Notes in Computer Science  
An acyclic edge-colouring of a graph is a proper edge-colouring such that the subgraph induced by the edges of any two colours is acyclic. The acyclic chromatic index of a graph G is the smallest possible number of colours in an acyclic edge-colouring of G. In [12], we have shown that the acyclic chromatic index of a connected subcubic graph G is at most 4 with the exception of K4 and K3,3, for which five colors are optimal. Here we give a quadratic-time algorithm that finds an acyclic
more » ... louring of a given connected subcubic graph different from K4 and K3,3.
doi:10.1007/978-3-642-21204-8_17 fatcat:bxdyxkl3ivetvm4ilkpc2tvbbu