Tala Eagling-Vose

collaborators

3 papers

cs.DS2025

Finding $d$ -Cuts in Probe $H$ -Free Graphs

Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson +2

For an integer $d \geq 1$ , the $d$ -Cut problem is that of deciding whether a graph has an edge cut in which each vertex is adjacent to at most $d$ vertices on the opposite side of t…

cs.DM2025

Bounding Width on Graph Classes of Constant Diameter

Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler +2

We determine if the width of a graph class $G$ changes from unbounded to bounded if we consider only those graphs from $G$ whose diameter is bounded. As parameters we…

math.CO2025

Finding d-Cuts in Claw-free Graphs

Jungho Ahn, Tala Eagling-Vose, Felicia Lucke +2

The Matching Cut problem is to decide if the vertex set of a connected graph can be partitioned into two non-empty sets $B$ and $R$ such that the edges between $B$ and $R$ form a m…

Finding d-Cuts in Probe H-Free Graphs

Bounding Width on Graph Classes of Constant Diameter

Finding d-Cuts in Claw-free Graphs

Finding $d$ -Cuts in Probe $H$ -Free Graphs