Parameterizing cut sets in a graph by the number of their components (Q653326): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.07.005
@@ Property / DOI: 10.1016/j.tcs.2011.07.005 / rank @@
-Normal rank
@@ Property / author @@
-Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
-Normal rank
@@ Property / author @@
+Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.07.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2074539191
@@ Property / OpenAlex ID: W2074539191 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+On stable cutsets in graphs
@@ Property / cites work: On stable cutsets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of the List Partition Problem for Graphs
+Normal rank
@@ Property / cites work @@
+Recognizing decomposable graphs
@@ Property / cites work: Recognizing decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Finding<i>H</i>-partitions efficiently
@@ Property / cites work: Finding<i>H</i>-partitions efficiently / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+List Partitions
@@ Property / cites work: List Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Covering graphs with few complete bipartite subgraphs
+Normal rank
@@ Property / cites work @@
+Contraction obstructions for treewidth
@@ Property / cites work: Contraction obstructions for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterizing Cut Sets in a Graph by the Number of Their Components
+Normal rank
@@ Property / cites work @@
+The computational complexity of disconnected cut and \(2 K_2\)-partition
+Normal rank
@@ Property / cites work @@
+Treewidth reduction for constrained separation and bipartization problems
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Compaction to Reflexive Cycles
+Normal rank
@@ Property / cites work @@
+An algorithm for finding clique cut-sets
@@ Property / cites work: An algorithm for finding clique cut-sets / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.07.005
@@ Property / DOI: 10.1016/J.TCS.2011.07.005 / rank @@
+Normal rank