Packing paths perfectly

DOI10.1016/0012-365X(90)90382-RzbMath0723.05092MaRDI QIDQ757434

Vašek Chvátal, Jin Akiyama

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmlargest number of vertex-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ Geodesic packing in graphs ⋮ Planar packing of trees and spider trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Complexity of General Graph Factor Problems
• Line perfect graphs
• Paths, Trees, and Flowers
• On the completeness of a generalized matching problem