Skip to Main content Skip to Navigation
Journal articles

Acyclic colourings of graphs with bounded degree

Abstract : A k-colouring of a graph G is called acyclic if for every two distinct colours i and j, the subgraph induced in G by all the edges linking a vertex coloured with i and a vertex coloured with j is acyclic. In other words, there are no bichromatic alternating cycles. In 1999 Boiron et al. conjectured that a graph G with maximum degree at most 3 has an acyclic 2-colouring such that the set of vertices in each colour induces a subgraph with maximum degree at most 2. In this paper we prove this conjecture and show that such a colouring of a cubic graph can be determined in polynomial time. We also prove that it is an NP-complete problem to decide if a graph with maximum degree 4 has the above mentioned colouring.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 3:36:16 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:17 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:04:51 PM


Files produced by the author(s)




Mieczyslaw Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Jozefczyk, Elzbieta Sidorowicz. Acyclic colourings of graphs with bounded degree. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, Vol. 12 no. 1 (1), pp.59-74. ⟨10.46298/dmtcs.483⟩. ⟨hal-00990426⟩



Record views


Files downloads