# Disconnected Cuts in Claw-free Graphs

## TL;DR

This paper proves that the Disconnected Cut problem can be solved in polynomial time for claw-free graphs, resolving an open question and introducing a new decomposition theorem for these graphs.

## Contribution

It introduces a novel decomposition theorem for claw-free graphs of diameter 2 and proves polynomial-time solvability of Disconnected Cut on claw-free, circular-arc, and line graphs.

## Key findings

- Disconnected Cut is polynomial-time solvable on claw-free graphs.
- The paper characterizes interactions between disconnected cuts and cobipartite subgraphs.
- Polynomial algorithms are provided for circular-arc and line graphs.

## Abstract

A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several homomorphism and contraction problems, and fits in an extensive line of research on vertex cuts with additional properties. It is known that Disconnected Cut is NP-hard on general graphs, while polynomial-time algorithms are known 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 $C_4$ 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 centerpiece of our result is a novel decomposition theorem for claw-free graphs of diameter 2, which we believe is of independent interest and expands 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 novel algorithmic results, namely Disconnected Cut is polynomial-time solvable on circular-arc graphs and line graphs.