An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730): Difference between revisions

@@ Property / cites work @@
+Factors and factorizations of graphs—a survey
@@ Property / cites work: Factors and factorizations of graphs—a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized planar matching
@@ Property / cites work: Generalized planar matching / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum packing of 3-edge paths
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Q2725320
@@ Property / cites work: Q2725320 / rank @@
+Normal rank
@@ Property / cites work @@
+Path factors in cubic graphs
@@ Property / cites work: Path factors in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+How many disjoint 2-edge paths must a cubic graph have?
+Normal rank
@@ Property / cites work @@
+Parallel Processing and Applied Mathematics
@@ Property / cites work: Parallel Processing and Applied Mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Chain packing in graphs
@@ Property / cites work: Chain packing in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On gallery watchmen in grids
@@ Property / cites work: On gallery watchmen in grids / rank @@
+Normal rank