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

TL;DR

This paper investigates the computational complexity of transforming graphs into specific classes via vertex splitting, identifying polynomial cases and NP-hard cases for various target classes.

Contribution

It provides a comprehensive complexity analysis of the F-Vertex Splitting problem for multiple graph classes, including polynomial-time algorithms and NP-hardness proofs.

Findings

Polynomial-time solvable for cycle graphs and linear forests.

NP-complete for constellations and bipartite graphs.

Analyzes both inclusive and exclusive vertex splitting variants.

Abstract

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 belonging to a graph class F through a sequence of at most k vertex splits. We investigate this problem for several target graph classes, namely constellations, cycle graphs, linear forests, and bipartite graphs. We analyze both inclusive and exclusive variants of vertex splitting, as introduced by Abu-Khzam and collaborators (ISCO 2018). Our results show that the F-Vertex Splitting problem is polynomial-time solvable when F is a cycle graph or a linear forest, for both variants. In contrast, when F is a constellation or a bipartite graph, the problem is NP-complete for both variants.