scientific article; zbMATH DE number 3496213
From MaRDI portal
zbMath0317.05119MaRDI QIDQ4078069
William R. Pulleyblank, Jack Edmonds
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Binary group and Chinese postman polyhedra, Fractional matchings and the Edmonds-Gallai theorem, A construction for non-rank facets of stable set polytopes of webs, A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective, On the facets of stable set polytopes of circular interval graphs, When the Gomory-chvátal closure coincides with the integer hull, A matching problem with side conditions, Packing $k$-Matchings and $k$-Critical Graphs, Discrete extremal problems, On claw-free \(t\)-perfect graphs, On the facets of the stable set polytope of quasi-line graphs, Matchings in regular graphs, Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, Facet Generating Techniques, Clique family inequalities for the stable set polytope of quasi-line graphs., Packing subgraphs in a graph, The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory, Matching theory -- a sampler: From Dénes König to the present, Packings and perfect path double covers of maximal planar graphs, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, Dynamic matchings and quasidynamic fractional matchings. II, On non-rank facets of stable set polytopes of webs with clique number four, Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers, Facets of the independent path-matching polytope, Gear composition and the stable set polytope, Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem, The cyclical scheduling problem, Weighted restricted 2-matching, When Is the Matching Polytope Box-Totally Dual Integral?, Matchings and covers in hypergraphs, The perfectly matchable subgraph polytope of an arbitrary graph, Integer programming duality: Price functions and sensitivity analysis, Generalized network design polyhedra, Unnamed Item, König-Egerváry graphs, 2-bicritical graphs and fractional matchings, Lovász-Schrijver PSD-Operator on Claw-Free Graphs, Rank of maximum matchings in a graph, Optimum matching forests I: Special weights, Optimum matching forests II: General weights, On matroid parity and matching polytopes, Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem, Brick decompositions and the matching rank of graphs, Almost all webs are not rank-perfect, A note on matchings and separability
