We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Disconnected cuts in claw-free graphs.

Martin, B. and Paulusma, D. and van Leeuwen, E.J. (2020) 'Disconnected cuts in claw-free graphs.', Journal of computer and system sciences., 113 . pp. 60-75.


A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The corresponding decision problem is called Disconnected Cut. This problem is known to be NP-hard on general graphs. We prove that it is polynomial-time solvable on claw-free graphs, answering a question of Ito et al. (TCS 2011). The basis for our result is a decomposition theorem for claw-free graphs of diameter 2, which we believe is of independent interest and builds on the research line initiated by Chudnovsky and Seymour (JCTB 2007–2012) and Hermelin et al. (ICALP 2011). On our way to exploit this decomposition theorem, we characterize how disconnected cuts interact with certain cobipartite subgraphs, and prove two further algorithmic results, namely that Disconnected Cut is polynomial-time solvable on circular-arc graphs and line graphs.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF
Publisher Web site:
Publisher statement:© 2020 This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Date accepted:02 April 2020
Date deposited:26 April 2020
Date of first online publication:11 May 2020
Date first made open access:11 May 2021

Save or Share this output

Look up in GoogleScholar