Packing paths perfectly (Q757434): Difference between revisions

A class of graphs is characterized in which the largest number of vertex- disjoint paths of length two can be found in polynomial time. Membership in this class can be tested in polynomial time.

0 references

Mathematics Subject Classification ID

05C70

0 references

0 references

0 references

algorithm

0 references

largest number of vertex-disjoint paths

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5184946

0 references

Paths, Trees, and Flowers

0 references

Q3216686

0 references

Q3929772

0 references

On the completeness of a generalized matching problem

0 references

On the Complexity of General Graph Factor Problems

0 references

Line perfect graphs

0 references

Q3686753

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:757434

@@ Property / cites work @@
+Q5184946
@@ Property / cites work: Q5184946 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3929772
@@ Property / cites work: Q3929772 / rank @@
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Line perfect graphs
@@ Property / cites work: Line perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3686753
@@ Property / cites work: Q3686753 / rank @@
+Normal rank