Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-008-0807-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2083270457
@@ Property / OpenAlex ID: W2083270457 / rank @@
+Normal rank
@@ 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 @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Path factors in cubic graphs
@@ Property / cites work: Path factors in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Packingk-edge trees in graphs of restricted vertex degrees
+Normal rank
@@ Property / cites work @@
+How many disjoint 2-edge paths must a cubic graph have?
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
+Normal rank
@@ Property / cites work @@
+Q3070345
@@ Property / cites work: Q3070345 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1014835