An extension of matching theory
From MaRDI portal
Publication:1057288
DOI10.1016/0095-8956(86)90085-7zbMath0563.05048OpenAlexW2086077818MaRDI QIDQ1057288
Cornuéjols, Gérard, David B. Hartvigsen
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90085-7
Related Items
About a new class of matroid-inducing packing families, Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles, Fractional matchings and the Edmonds-Gallai theorem, The superstar packing problem, On matroids induced by packing subgraphs, Optimal packing of induced stars in a graph, Graph factors and factorization: 1985--2003: a survey, Unnamed Item, Induced graph packing problems, Remarks on component factors, Approximations for the Steiner multicycle problem, Minimum-Weight Cycle Covers and Their Approximability, Packing $k$-Matchings and $k$-Critical Graphs, A better differential approximation ratio for symmetric TSP, Kőnig's edge-colouring theorem for all graphs, Matchings of cycles and paths in directed graphs, Structural properties of matroid matchings, An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem, Good characterizations for some degree constrained subgraphs, On the complexity of digraph packings, Weighted restricted 2-matching, Packing trees with constraints on the leaf degree, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Minimum-weight cycle covers and their approximability, The Nonnegative Node Weight j-Restricted k-Matching Problems
Cites Work
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- F-factors of graphs: A generalized matching problem
- Packing subgraphs in a graph
- On the Complexity of General Graph Factor Problems
- Dynamic matchings and quasidynamic fractional matchings. II
- TWO THEOREMS IN GRAPH THEORY
- Integer and Fractional Matchings
- Paths, Trees, and Flowers
- Transversals and matroid partition
- The Factorization of Linear Graphs
- Unnamed Item
- Unnamed Item
