Partitioning powers of traceable or Hamiltonian graphs (Q391776): Difference between revisions

@@ Property / cites work @@
+Packing closed trails into dense graphs.
@@ Property / cites work: Packing closed trails into dense graphs. / rank @@
+Normal rank
@@ 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 @@
+Recursively arbitrarily vertex-decomposable suns
@@ Property / cites work: Recursively arbitrarily vertex-decomposable suns / rank @@
+Normal rank
@@ Property / cites work @@
+Arbitrarily vertex decomposable caterpillars with four or five leaves
+Normal rank
@@ Property / cites work @@
+Q4168622
@@ Property / cites work: Q4168622 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5481324
@@ Property / cites work: Q5481324 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Complete Bipartite Even Graphs into Closed Trails
+Normal rank
@@ Property / cites work @@
+On arbitrarily vertex decomposable trees
@@ Property / cites work: On arbitrarily vertex decomposable trees / rank @@
+Normal rank
@@ Property / cites work @@
+Dense arbitrarily vertex decomposable graphs
@@ Property / cites work: Dense arbitrarily vertex decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A homology theory for spanning tress of a graph
@@ Property / cites work: A homology theory for spanning tress of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for four-partitioning four-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Decomposing trees with large diameter
@@ Property / cites work: Decomposing trees with large diameter / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for bipartition of biconnected graphs
+Normal rank