Packing paths perfectly
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.
scientific article; zbMATH DE number 4191720