Disconnected Cuts in Claw-free Graphs

@inproceedings{Martin2018DisconnectedCI,
  title={Disconnected Cuts in Claw-free Graphs},
  author={B. Martin and D. Paulusma and E. J. V. Leeuwen},
  booktitle={ESA},
  year={2018}
}
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… Expand
2 Citations
Disconnected cuts in claw-free graphs
  • PDF
Domination When the Stars Are Out
  • 7

References

SHOWING 1-10 OF 45 REFERENCES
Minimal disconnected cuts in planar graphs
  • 3
  • PDF
Minimal Disconnected Cuts in Planar Graphs
  • 2
  • PDF
The computational complexity of disconnected cut and 2K2-partition
  • 27
  • PDF
A note on contracting claw-free graphs
  • 16
  • PDF
On disconnected cuts and separators
  • 9
  • PDF
The structure of claw-free graphs
  • 185
  • Highly Influential
  • PDF
Parameterizing Cut Sets in a Graph by the Number of Their Components
  • 8
Domination When the Stars Are Out
  • 7
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction
  • N. Vikas
  • Mathematics, Computer Science
  • Algorithmica
  • 2012
  • 18
2k2-partition of Some Classes of Graphs
  • 9
  • Highly Influential
...
1
2
3
4
5
...