The Computational Complexity of Disconnected Cut and 2K2-Partition

Details The Computational Complexity of Disconnected Cut and 2K2-Partition The Computational Complexity of Disconnected Cut and 2K2-Partition

2011-04-25

arxiv.org/abs/1104.4779v2

Computer Science

Computational Complexity

Conference version appeared at CP 2011

Scientific paper

For a connected graph G=(V,E), a subset U of 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 2K2-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.

Affiliated with

Also associated with

No associations

Rating

The Computational Complexity of Disconnected Cut and 2K2-Partition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Computational Complexity of Disconnected Cut and 2K2-Partition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Computational Complexity of Disconnected Cut and 2K2-Partition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545513