Partitioning a Graph into Complementary Subgraphs

Abstract

In the Partition Into Complementary Subgraphs (Comp-Sub) problem we are given a graph $G=(V,E)$, and an edge set property $\varPi$, and asked whether G can be decomposed into two graphs, H and its complement $\overline{H}$, for some graph H, in such a way that the edge cut-set (of the cut) $[V(H),V(\overline{H})]$ satisfies property $\varPi$. Such a problem is motivated by the fact that several parameterized problems are trivially fixed-parameter tractable when the input graph G is decomposable into two complementary subgraphs. In addition, it generalizes the recognition of complementary prism graphs, and it is related to graph isomorphism when the desired cut-set is empty, Comp-Sub($\emptyset$). In this paper we are particularly interested in the case Comp-Sub($\emptyset$), where the decomposition also partitions the set of edges of G into E(H) and $E(\overline{H})$. When the input is a chordal graph, we show that Comp-Sub($\emptyset$) is ${\textsf {GI}}{\text{-}}{\textit{complete}}$, that is, polynomially equivalent to Graph Isomorphism. But it becomes more tractable than Graph Isomorphism for several subclasses of chordal graphs. We present structural characterizations for split, starlike, block, and unit interval graphs. We also obtain complexity results for permutation graphs, cographs, comparability graphs, co-comparability graphs, interval graphs, co-interval graphs and strongly chordal graphs. Furthermore, we present some remarks when $\varPi$ is a general edge set property and the case when the cut-set M induces a complete bipartite graph.