Packing paths perfectly

DOI10.1016/0012-365X(90)90382-RMaRDI QIDQ757434zbMATH OpenFDO

Authors Jin Akiyama, Vašek Chvátal

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)

Recommendations

• Packing paths of length at least two
• Chain packing in graphs
• scientific article; zbMATH DE number 1960287
• scientific article; zbMATH DE number 4089565
• Packing paths in planar graphs

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3908479 (Why is no real title available?)
• scientific article; zbMATH DE number 3743308 (Why is no real title available?)
• scientific article; zbMATH DE number 3893247 (Why is no real title available?)
• Line perfect graphs
• On the Complexity of General Graph Factor Problems
• On the completeness of a generalized matching problem
• Paths, Trees, and Flowers

Cited in

(8)

• Counting Paths and Packings in Halves
• Local improvement algorithms for a path packing problem: a performance analysis based on linear programming
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
• Optimum path packing on wheels: The consecutive case
• Planar packing of trees and spider trees
• Packing paths: recycling saves time
• Geodesic packing in graphs
• Packing paths of length at least two

This page was built for publication: Packing paths perfectly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757434)