On partitioning a graph into two connected subgraphs
type: Item
instance of: scholarly article
title: On partitioning a graph into two connected subgraphs
zbMATH Open document ID: 1228.68032
author: Daniël Paulusma
author: Johan M. M. Van Rooij
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5987002
zbMATH Keywords: disjoint connected subgraphs
zbMATH Keywords: dominating set
zbMATH Keywords: exact algorithm
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2011.09.001
OpenAlex ID: W2019800388
cites work: Q4227911
cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem
cites work: Set Partitioning via Inclusion-Exclusion
cites work: The vertex separation and search number of a graph
cites work: On two techniques of combining branching and treewidth
cites work: Automata, Languages and Programming
cites work: Solving connected dominating set faster than \(2^n\)
cites work: Combinatorial bounds via measure and conquer
cites work: Removing local extrema from imprecise terrains
cites work: A new characterization of \(P_{6}\)-free graphs
cites work: Partitioning graphs into connected parts
cites work: Q4198056
cites work: Dynamic programming meets the principle of inclusion and exclusion
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Inclusion/Exclusion Meets Measure and Conquer
DOI: 10.1016/J.TCS.2011.09.001
Recommended article: On Partitioning a Graph into Two Connected Subgraphs
Recommended article: On partitioning the edges of graphs into connected subgraphs
Recommended article: On the complexity of partitioning graphs into connected subgraphs
Recommended article: On the complexity of partitioning a graph into a few connected subgraphs
Recommended article: Partitioning graphs into connected parts
Recommended article: Partitioning Graphs into Connected Parts
Recommended article: Partitioning a k-connected graph
Recommended article: A partition of connected graphs
Recommended article: Partitioning a Graph into Highly Connected Subgraphs
Recommended article: Q5233771
description: scientific article; zbMATH DE number 5987002