The Computational Complexity of Disconnected Cut and 2K2-Partition

Barnaby Martin, Daniël Paulusma

Type: Preprint

Publication Date: 2011-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1104.4779

View Publication

Locations

Durham Research Online (Durham University) - View - PDF
arXiv (Cornell University) - View - PDF
Durham Research Online (Durham University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	The Computational Complexity of Disconnected Cut and 2K2-Partition	2011	Barnaby Martin Daniël Paulusma
+ PDF Chat	The Computational Complexity of Disconnected Cut and 2K 2-Partition	2011	Barnaby Martin Daniël Paulusma
+	Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph	1987	Yoshimi Egawa
+ PDF Chat	Computational Complexity of Covering Disconnected Multigraphs	2021	Jan Bok Jiřı́ Fiala Nikola Jedličková Jan Kratochvı́l Michaela Seifrtová
+	Disconnected Cuts in Claw-free Graphs	2018	Barnaby Martin Daniël Paulusma Erik Jan van Leeuwen
+	Disconnected Cuts in Claw-free Graphs	2018	Barnaby Martin Daniël Paulusma Erik Jan van Leeuwen
+	On partitioning a graph into two connected subgraphs	2011	Daniël Paulusma Johan M. M. van Rooij
+	On Partitioning a Graph into Two Connected Subgraphs	2009	Daniël Paulusma Johan M. M. van Rooij
+	On the Complexity of the K-way Vertex Cut Problem	2021	Mohammed Lalou
+ PDF Chat	On the Complexity of the K-way Vertex Cut Problem	2021	Mohammed Lalou
+	Computing the $5$-Edge-Connected Components in Linear Time	2023	Evangelos Kosinas
+	Computational Complexity of Covering Disconnected Multigraphs	2023	Jan Bok Jiřı́ Fiala Nikola Jedličková Jan Kratochvı́l Michaela Seifrtová
+ PDF Chat	Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs	2014	О. И. Дугинов
+	Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph	2014	Faisal N. Abu-Khzam Carl Feghali Haiko Müller
+ PDF Chat	Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs	2024	Hoàng-Oanh Le Van Bang Lê
+	Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph	2014	Faisal N. Abu-Khzam Carl Feghali Haiko Müller
+	On the complexity of computing the k-restricted edge-connectivity of a graph	2016	Luis Montejano Ignasi Sau
+ PDF Chat	On the Complexity of Computing the k-restricted Edge-connectivity of a Graph	2016	Luis Montejano Ignasi Sau
+	Partitioning a graph into disjoint cliques and a triangle-free graph	2015	Faisal N. Abu-Khzam Carl Feghali Haiko Müller
+ PDF Chat	Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets	2024	Tara Abrishami Maria Chudnovsky Sepehr Hajebi Sophie Spirkl

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors