The Computational Complexity of Disconnected Cut and 2K2-Partition
For a connected graph G = (V,E), a subset U ⊆ V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. This problem is polynomially equivalent to the following problems: testing if a graph has a 2K 2-partition, testing if a graph allows a vertex-surjective homomorphism to the reflexive 4-cycle and testing if a graph has a spanning subgraph that consists of at most two bicliques. Hence, as an immediate consequence, these three decision problems are NP-complete as well. This settles an open problem frequently posed in each of the four settings.
KeywordsComputational Complexity Constraint Satisfaction Input Graph Surjective Homomorphism Span Subgraph
Unable to display preview. Download preview PDF.
- 2.Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of LICS 2003, pp. 321–330 (2003)Google Scholar
- 8.Dantas, S., Maffray, F., Silva, A.: 2K 2-partition of some classes of graphs. Discrete Applied Mathematics (to appear)Google Scholar
- 11.de Figueiredo, C.M.H.: The P versus NP-complete dichotomy of some challenging problems in graph theory. Discrete Applied Mathematics (to appear)Google Scholar
- 16.Ito, T., Kaminski, M., Paulusma, D., Thilikos, D.M.: On disconnected cuts and separators. Discrete Applied Mathematics (to appear)Google Scholar
- 17.Martin, B., Paulusma, D.: The Computational Complexity of Disconnected Cut and 2K2-Partition, http://arxiv.org/abs/1104.4779