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, Barnaby and Paulusma, Daniel and van Leeuwen, Erik Jan (2018) 'Disconnected cuts in claw-free graphs.', in 26th Annual European Symposium on Algorithms (ESA 2018). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 61:1-61:14. Leibniz International Proceedings in Informatics (LIPIcs)., 112


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. It is known that Disconnected Cut is NP-hard on general graphs, while polynomial-time algorithms exist for several graph classes. However, the complexity of the problem on claw-free graphs remained an open question. Its connection to the complexity of the problem to contract a claw-free graph to the 4-vertex cycle C4 led Ito et al. (TCS 2011) to explicitly ask to resolve this open question. We prove that Disconnected Cut is polynomial-time solvable on claw-free graphs, answering the question of Ito et al. 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:Book chapter
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution.
Download PDF
Publisher Web site:
Publisher statement:© Barnaby Martin, Daniël Paulusma and Erik Jan van Leeuwen; licensed under Creative Commons License CC-BY.
Date accepted:15 June 2018
Date deposited:13 July 2018
Date of first online publication:2018
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar