A note on path-matchings

zbMATH Open1224.05428MaRDI QIDQ3073565FDOQ3073565

Authors: Jingzhi Yan, Heping Zhang 

Publication date: 11 February 2011

Recommendations

• A Gallai–Edmonds‐type structure theorem for path‐matchings
• scientific article; zbMATH DE number 1161279
• Note on the path‐matching formula
• The optimal path-matching problem
• scientific article; zbMATH DE number 568824

zbMATH Keywords

Gallai-Edmonds-type structure theoremextreme setpath-matching

Mathematics Subject Classification ID

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

Cited In (6)

• A Gallai–Edmonds‐type structure theorem for path‐matchings
• Note on the path‐matching formula
• Splitters and barriers in open graphs having a perfect internal matching
• Bounds on the path-matching number
• Disclosing barriers: a generalization of the canonical partition based on Lovász's formulation
• Maximal tight sets and the Edmonds-Gallai decomposition for matchings

This page was built for publication: A note on path-matchings

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