Pages that link to "Item:Q790834"
From MaRDI portal
The following pages link to Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834):
Displaying 18 items.
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Weighted restricted 2-matching (Q1013978) (← links)
- An extension of matching theory (Q1057288) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- Packing subgraphs in a graph (Q1166429) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem (Q2288180) (← links)
- Matchings of cycles and paths in directed graphs (Q2460633) (← links)
- Ear-slicing for matchings in hypergraphs (Q2657060) (← links)
- Fractional matchings, component-factors and edge-chromatic critical graphs (Q2657106) (← links)
- Characterizing N+-perfect line graphs (Q2968506) (← links)
- TRIANGLE-FREE 2-MATCHINGS REVISITED (Q3084696) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
