23 citations · 150 across the 51 of their papers we have counts for
6 papers · 1 filter
Partitioning the vertices of a torus into isomorphic subgraphs
Marthe Bonamy, Natasha Morrison, Alex Scott
Let be an induced subgraph of the torus . We show that when is even and divides some power of , then for sufficiently large the torus h…
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…
The Interactive Sum Choice Number of Graphs
Marthe Bonamy, Kitty Meeks
We introduce a variant of the well-studied sum choice number of graphs, which we call the interactive sum choice number. In this variant, we request colours to be added to the vert…