Partitioning graphs into connected parts (Q1034603): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.06.028
+Normal rank
@@ Property / OpenAlex ID @@
+W4213168420
@@ Property / OpenAlex ID: W4213168420 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227911
@@ Property / cites work: Q4227911 / rank @@
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the stable set problem in special \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+A new characterization of \(P_{6}\)-free graphs
@@ Property / cites work: A new characterization of \(P_{6}\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Stable sets in certain \(P_6\)-free graphs
@@ Property / cites work: Stable sets in certain \(P_6\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q2770587
@@ Property / cites work: Q2770587 / rank @@
+Normal rank