Induced path factors of regular graphs (Q6055940): Difference between revisions

@@ Property / cites work @@
+Q5708983
@@ Property / cites work: Q5708983 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4305536
@@ Property / cites work: Q4305536 / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum leaf number of cubic graphs
@@ Property / cites work: On the minimum leaf number of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates
+Normal rank
@@ Property / cites work @@
+Spanning even subgraphs of 3‐edge‐connected graphs
+Normal rank
@@ Property / cites work @@
+Path factors in cubic graphs
@@ Property / cites work: Path factors in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Splitting a graph into disjoint induced paths or cycles.
+Normal rank
@@ Property / cites work @@
+Q3614027
@@ Property / cites work: Q3614027 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced-path partition on graphs with special blocks
+Normal rank
@@ Property / cites work @@
+Paths, Stars and the Number Three
@@ Property / cites work: Paths, Stars and the Number Three / rank @@
+Normal rank
@@ Property / cites work @@
+Covering 2‐connected 3‐regular graphs with disjoint paths
+Normal rank