Hardness of Vertex Splitting: Cographs, Chordal Graphs, and Beyond

Satyabrata Jana, Shivesh K. Roy, R. B. Sandeep

Vertex splitting replaces a vertex (v) by two nonadjacent vertices whose neighborhoods together equal (N(v)). A split is \emph{exclusive} if these neighborhoods are disjoint and \e…