38 citations · 246 across the 68 of their papers we have counts for
4 papers · 2 filters
On Colouring -Free and -Free Graphs
Konrad Dabrowski, Daniel Paulusma
The Colouring problem asks whether the vertices of a graph can be coloured with at most colours for a given integer in such a way that no two adjacent vertices receive the…
Surjective H-Colouring over Reflexive Digraphs
Benoit Larose, Barnaby Martin, Daniel Paulusma
The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for…
Critical Vertices and Edges in -free Graphs
Daniël Paulusma, Christophe Picouleau, Bernard Ries
A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by 1. We consider the problems of deciding whether a graph has a critical vertex o…
Surjective H-Colouring: New Hardness Results
Petr Golovach, Matthew Johnson. Barnaby Martin, Daniel Paulusma +1
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H when…