An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem

DOI10.37236/7837zbMath1439.05191OpenAlexW2999246665MaRDI QIDQ2288180

Yanjun Li, Jácint Szabó

Publication date: 17 January 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p15

zbMATH Keywords

\(k\)-matching\(j\)-restricted \(k\)-matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
• An extension of matching theory
• Packings by cliques and by finite families of graphs
• On matroids induced by packing subgraphs
• Packing subgraphs in a graph
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
• Packing paths of length at least two
• The Nonnegative Node Weight j-Restricted k-Matching Problems
• Paths, Trees, and Flowers
• The k‐piece packing problem

This page was built for publication: An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem