Parameterizing cut sets in a graph by the number of their components
Authors:
- 1 October 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (45) , 6340-6350
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Contraction obstructions for treewidthJournal of Combinatorial Theory, Series B, 2011
- Covering graphs with few complete bipartite subgraphsTheoretical Computer Science, 2009
- FindingH-partitions efficientlyRAIRO - Theoretical Informatics and Applications, 2005
- List PartitionsSIAM Journal on Discrete Mathematics, 2003
- Graphs on surfacesChoice Reviews Online, 2002
- On stable cutsets in graphsDiscrete Applied Mathematics, 2000
- Diameter and Treewidth in Minor-Closed Graph FamiliesAlgorithmica, 2000
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Contractibility and NP‐completenessJournal of Graph Theory, 1987
- Recognizing decomposable graphsJournal of Graph Theory, 1984