On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512): Difference between revisions

@@ Property / cites work @@
+Decomposable trees: A polynomial algorithm for tripodes
+Normal rank
@@ Property / cites work @@
+A degree bound on decomposable trees
@@ Property / cites work: A degree bound on decomposable trees / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning powers of traceable or Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+Q5173159
@@ Property / cites work: Q5173159 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning a graph into a few connected subgraphs
+Normal rank
@@ Property / cites work @@
+Fully decomposable split graphs
@@ Property / cites work: Fully decomposable split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549563
@@ Property / cites work: Q3549563 / rank @@
+Normal rank
@@ Property / cites work @@
+Dense arbitrarily vertex decomposable graphs
@@ Property / cites work: Dense arbitrarily vertex decomposable graphs / rank @@
+Normal rank