The following pages link to An extension of matching theory (Q1057288):
Displaying 30 items.
- Induced graph packing problems (Q604669) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Good characterizations for some degree constrained subgraphs (Q1003846) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- Weighted restricted 2-matching (Q1013978) (← links)
- Packing trees with constraints on the leaf degree (Q1014830) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- Optimal packing of induced stars in a graph (Q1367032) (← links)
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles (Q1637143) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- The superstar packing problem (Q2149487) (← links)
- Extendability and criticality in matching theory (Q2175791) (← links)
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem (Q2288180) (← links)
- About a new class of matroid-inducing packing families (Q2370439) (← links)
- Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
- Matchings of cycles and paths in directed graphs (Q2460633) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- (Q4379742) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- (Q4711754) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- (Q5306146) (← links)
- A normal law for matchings (Q5932660) (← links)
- Remarks on component factors (Q6093996) (← links)
- Approximations for the Steiner multicycle problem (Q6109004) (← links)
- A simple matching domain with indifferences and a master list (Q6156344) (← links)
