A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs

2020
*
European Symposium on Algorithms
*

A k-colouring c of a graph G is a mapping V(G) → {1,2,... k} such that c(u) ≠ c(v) whenever u and v are adjacent. The corresponding decision problem is Colouring. A colouring is acyclic, star, or injective if any two colour classes induce a forest, star forest or disjoint union of vertices and edges, respectively. Hence, every injective colouring is a star colouring and every star colouring is an acyclic colouring. The corresponding decision problems are Acyclic Colouring, Star Colouring and

doi:10.4230/lipics.esa.2020.22
dblp:conf/esa/BokJMPS20
fatcat:a62lakmnzrggpodmolwr3uicsa