The following pages link to (Q4078069):
Displaying 44 items.
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- Packings and perfect path double covers of maximal planar graphs (Q686163) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- The cyclical scheduling problem (Q744050) (← links)
- The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- A note on matchings and separability (Q802467) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory (Q943797) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- Weighted restricted 2-matching (Q1013978) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective (Q1133463) (← links)
- A matching problem with side conditions (Q1145707) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Matchings in regular graphs (Q1155070) (← links)
- Packing subgraphs in a graph (Q1166429) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) (← links)
- Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers (Q2022517) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- On non-rank facets of stable set polytopes of webs with clique number four (Q2492218) (← links)
- Facets of the independent path-matching polytope (Q2506818) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- Dynamic matchings and quasidynamic fractional matchings. II (Q3040951) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- Rank of maximum matchings in a graph (Q3922477) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- Optimum matching forests II: General weights (Q3922479) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- When Is the Matching Polytope Box-Totally Dual Integral? (Q5219300) (← links)
- (Q5708546) (← links)
