D
Daniël Paulusma
Researcher at Durham University
Publications - 372
Citations - 4532
Daniël Paulusma is an academic researcher from Durham University. The author has contributed to research in topics: Induced subgraph & Chordal graph. The author has an hindex of 31, co-authored 352 publications receiving 3958 citations. Previous affiliations of Daniël Paulusma include University of Bergen & University of Cologne.
Papers
More filters
Book ChapterDOI
Injective Colouring for H-Free Graphs
TL;DR: In this paper, the complexity of injective colouring on H-free graphs was shown to be polynomial in the number of vertices and edges in the graph. And they proved a dichotomy for Injective Colouring for graphs with bounded independence number.
Posted Content
Induced Disjoint Paths in Claw-Free Graphs
TL;DR: Several related problems, such as the Induced Disjoint Paths problem, are proved to be fixed-parameter tractable for claw-free graphs when parameterized by $k, and the problem becomes NP-complete, even when $k=2, for the more general cla...
Book ChapterDOI
Computing Subset Transversals in H-Free Graphs
TL;DR: In this article, the authors study the computational complexity of two well-known graph transversal problems, Subset Feedback Vertex Set and Subset Odd Cycle Transversal, by restricting the input to H-free graphs, that is, to graphs that do not contain some fixed graph H as an induced subgraph.
Book ChapterDOI
The computational complexity of the parallel knock-out problem
TL;DR: It is shown that the problem of whether a given graph admits a scheme in which all vertices are eliminated in at most k rounds is NP-complete, and that both of these problems are shown to be solvable in polynomial time.
Posted Content
Colouring Square-Free Graphs without Long Induced Paths
TL;DR: In this paper, a divide-and-conqueriorage approach was proposed for bounding the clique-width of a subclass of Ω(C_4,P_t)$-free graphs.