23 citations · 150 across the 51 of their papers we have counts for
4 papers · 2 filters
Independent Feedback Vertex Set for -free Graphs
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali +2
The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer , to delete at most vertices from a given graph so t…
Independent Feedback Vertex Sets for Graphs of Bounded Diameter
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali +2
The Near-Bipartiteness problem is that of deciding whether or not the vertices of a graph can be partitioned into sets and , where is an independent set and induces…
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali +2
We continue research into a well-studied family of problems that ask whether the vertices of a graph can be partitioned into sets and~, where is an independent set and $…
On Directed Feedback Vertex Set parameterized by treewidth
Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof +3
We study the Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot…