Disconnected Cuts in Claw-free Graphs

Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen

Type: Preprint

Publication Date: 2018-01-01

Citations: 0

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

View Publication

Locations

Durham Research Online (Durham University) - View - PDF
arXiv (Cornell University) - View - PDF
Leibniz-Zentrum für Informatik (Schloss Dagstuhl) - View - PDF
Durham Research Online (Durham University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Disconnected Cuts in Claw-free Graphs	2018	Barnaby Martin Daniël Paulusma Erik Jan van Leeuwen
+	Disconnected cuts in claw-free graphs	2020	Barnaby Martin Daniël Paulusma Erik Jan van Leeuwen
+	Induced Disjoint Paths in Claw-Free Graphs	2012	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen
+	On the $d$-Claw Vertex Deletion Problem	2022	Sun‐Yuan Hsieh Hoàng-Oanh Le Van Bang Lê Sheng‐Lung Peng
+	Computing the Largest Bond and the Maximum Connected Cut of a Graph	2020	Gabriel L. Duarte Hiroshi Eto Tesshu Hanaka Yasuaki Kobayashi Yusuke Kobayashi Daniel Lokshtanov Lehilton L. C. Pedrosa Rafael C. S. Schouery Uéverton S. Souza
+	Computing the Largest Bond and the Maximum Connected Cut of a Graph	2020	Gabriel L. Duarte Hiroshi Eto Tesshu Hanaka Yasuaki Kobayashi Yusuke Kobayashi Daniel Lokshtanov Lehilton L. C. Pedrosa Rafael C. S. Schouery Uéverton S. Souza
+	Matching Cuts in Graphs of High Girth and H-Free Graphs	2022	Carl Feghali Felicia Lucke Daniël Paulusma Bernard Ries
+	Disconnected Matchings	2021	Guilherme C. M. Gomes Bruno P. Masquio Paulo E. D. Pinto Vinícius F. dos Santos Jayme L. Szwarcfiter
+	Sparse cuts, matching-cuts and leafy trees in graphs	2006	Paul Bonsma
+	Disjoint cliques in claw-free graphs	2018	Suyun Jiang Yan Jin
+	Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph	2012	Haruhide Matsuda Kenta Ozeki Tomoki Yamashita
+ PDF Chat	The Computational Complexity of Disconnected Cut and 2K 2-Partition	2011	Barnaby Martin Daniël Paulusma
+	Cuts and Connectivity	2000	W. D. Wallis
+	Complexity results for matching cut problems in graphs without long induced paths	2023	Hoàng-Oanh Le Van Bang Lê
+	Induced Disjoint Paths in AT-free Graphs	2020	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen
+	On Conflict-Free Cuts: Algorithms and Complexity	2023	J. Rauch Dieter Rautenbach Uéverton S. Souza
+	Vertex-disjoint claws in graphs	1999	Yoshimi Egawa Katsuhiro Ota
+	Vertex-disjoint claws in graphs	1999	Yoshimi Egawa Katsuhiro Ota
+	The Computational Complexity of Disconnected Cut and 2K2-Partition	2011	Barnaby Martin Daniël Paulusma
+	The Computational Complexity of Disconnected Cut and 2K2-Partition	2011	Barnaby Martin Daniël Paulusma

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors