On disconnected cuts and separators
From MaRDI portal
Publication:2275942
DOI10.1016/j.dam.2011.04.027zbMath1223.05155OpenAlexW2170353404MaRDI QIDQ2275942
Daniël Paulusma, Takehiro Ito, Dimitrios M. Thilikos, Marcin Kaminski
Publication date: 10 August 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.027
Related Items (6)
Minimal Disconnected Cuts in Planar Graphs ⋮ Disconnected cuts in claw-free graphs ⋮ Unnamed Item ⋮ The complexity of surjective homomorphism problems-a survey ⋮ The computational complexity of disconnected cut and \(2 K_2\)-partition ⋮ Graph partitions with prescribed patterns
Cites Work
- The external constraint 4 nonempty part sandwich problem
- Covering graphs with few complete bipartite subgraphs
- List homomorphisms to reflexive graphs
- \(2K_2\)-partition of some classes of graphs
- Parameterizing Cut Sets in a Graph by the Number of Their Components
- FindingH-partitions efficiently
- Computational Complexity of Compaction to Reflexive Cycles
- Unnamed Item
This page was built for publication: On disconnected cuts and separators
