Carl Feghali

activity

20162025

most citedMatching Cuts in Graphs of High Girth and H-Free Graphs

2 citations · 2 across the 15 of their papers we have counts for

collaborators

Showing 2017 · cs.DSShow all

3 papers · 2 filters

cs.DS2017

Independent Feedback Vertex Set for $P_{5}$ -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 $k \geq 0$ , to delete at most $k$ vertices from a given graph so t…

cs.DS2017

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 $A$ and $B$ , where $A$ is an independent set and $B$ induces…

cs.DS2017

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 $A$ and~ $B$ , where $A$ is an independent set and $…

Independent Feedback Vertex Set for P5​-free Graphs

Independent Feedback Vertex Sets for Graphs of Bounded Diameter

Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration

Independent Feedback Vertex Set for $P_{5}$ -free Graphs