Skip to main content

Research Repository

Advanced Search

Disconnected cuts in claw-free graphs

Martin, B.; Paulusma, D.; van Leeuwen, E.J.

Disconnected cuts in claw-free graphs Thumbnail


Authors

E.J. van Leeuwen



Abstract

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.

Citation

Martin, B., Paulusma, D., & van Leeuwen, E. (2020). Disconnected cuts in claw-free graphs. Journal of Computer and System Sciences, 113, 60-75. https://doi.org/10.1016/j.jcss.2020.04.005

Journal Article Type Article
Acceptance Date Apr 2, 2020
Online Publication Date May 11, 2020
Publication Date Nov 30, 2020
Deposit Date Apr 26, 2020
Publicly Available Date Mar 28, 2024
Journal Journal of Computer and System Sciences
Print ISSN 0022-0000
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 113
Pages 60-75
DOI https://doi.org/10.1016/j.jcss.2020.04.005
Public URL https://durham-repository.worktribe.com/output/1265560

Files





You might also like



Downloadable Citations