Parameterizing cut sets in a graph by the number of their components
type: Item
instance of: scholarly article
title: Parameterizing cut sets in a graph by the number of their components
zbMATH Open document ID: 1232.05115
author: Takehiro Ito
author: Daniël Paulusma
author: Dimitrios M. Thilikos
author: Marcin Kamiński
published in: Theoretical Computer Science
publication date: 2012-01-09T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5995826
zbMATH Keywords: disconnected cut
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.07.005
OpenAlex ID: W2074539191
cites work: A linear time algorithm for finding tree-decompositions of small treewidth
cites work: On stable cutsets in graphs
cites work: Contractibility and NP-completeness
cites work: The Complexity of the List Partition Problem for Graphs
cites work: Recognizing decomposable graphs
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: FindingH-partitions efficiently
cites work: Q5315023
cites work: Diameter and treewidth in minor-closed graph families
cites work: List Partitions
cites work: Covering graphs with few complete bipartite subgraphs
cites work: Contraction obstructions for treewidth
cites work: Q4198056
cites work: Parameterizing Cut Sets in a Graph by the Number of Their Components
cites work: The computational complexity of disconnected cut and \(2 K_2\)-partition
cites work: Treewidth reduction for constrained separation and bipartization problems
cites work: Graphs on surfaces
cites work: Q5710169
cites work: Computational Complexity of Compaction to Reflexive Cycles
cites work: An algorithm for finding clique cut-sets
DOI: 10.1016/J.TCS.2011.07.005
description: scientific article; zbMATH DE number 5995826