Acyclic edge colourings of graphs with large girth
X. S. Cai, G. Perarnau, B. Reed, A. B. Watts · Random Structures and Algorithms · 2016
An edge colouring of a graph G is called acyclic if it is proper and every cycle contains at least three colours. We show that for every , there exists a such that if G has maximum degree Δ and girth at least g then G admits an acyclic edge colouring with colours. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 511–533, 2017