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…