10 citations · 23 across the 31 of their papers we have counts for
3 papers · 2 filters
Partitioning H-Free Graphs of Bounded Diameter
Christoph Brause, Petr Golovach, Barnaby Martin +2
A natural way of increasing our understanding of NP-complete graph problems is to restrict the input to a special graph class. Classes of -free graphs, that is, graphs that do n…
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs
Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski
We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on -free graphs, that is, graphs that do not contain some fixed graph as an induced subgra…
Acyclic, Star, and Injective Colouring: Bounding the Diameter
Christoph Brause, Petr Golovach, Barnaby Martin +3
We examine the effect of bounding the diameter for well-studied variants of the Colouring problem. A colouring is acyclic, star, or injective if any two colour classes induce a for…