Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms

Ajinkya Gaikwad, Hitendra Kumar, S. Padmapriya +3

We study a family of graph modification problems called the F-Vertex Splitting problem. Given a graph G, the task is to determine whether G can be transformed into a graph G-prime…