scientific article; zbMATH DE number 3496213
From MaRDI portal
Publication:4078069
zbMATH Open0317.05119MaRDI QIDQ4078069FDOQ4078069
Authors: William R. Pulleyblank, Jack Edmonds 
Publication date: 1974
Title of this publication is not available (Why is that?)
Cited In (44)
- Almost all webs are not rank-perfect
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Packings and perfect path double covers of maximal planar graphs
- On claw-free \(t\)-perfect graphs
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
- Fractional matchings and the Edmonds-Gallai theorem
- Brick decompositions and the matching rank of graphs
- Packing subgraphs in a graph
- Gear composition and the stable set polytope
- Lovász-Schrijver PSD-operator on claw-free graphs
- A matching problem with side conditions
- Matchings in regular graphs
- Integer programming duality: Price functions and sensitivity analysis
- Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory
- Optimum matching forests I: Special weights
- Optimum matching forests II: General weights
- The cyclical scheduling problem
- When is the matching polytope box-totally dual integral?
- Matching theory -- a sampler: From Dénes König to the present
- Discrete extremal problems
- Title not available (Why is that?)
- Weighted restricted 2-matching
- When the Gomory-chvátal closure coincides with the integer hull
- A construction for non-rank facets of stable set polytopes of webs
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- The perfectly matchable subgraph polytope of an arbitrary graph
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Matchings and covers in hypergraphs
- Facet generating techniques
- On non-rank facets of stable set polytopes of webs with clique number four
- On the facets of the stable set polytope of quasi-line graphs
- On matroid parity and matching polytopes
- Facets of the independent path-matching polytope
- Binary group and Chinese postman polyhedra
- Rank of maximum matchings in a graph
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- Dynamic matchings and quasidynamic fractional matchings. II
- A note on matchings and separability
- Packing $k$-Matchings and $k$-Critical Graphs
- On the facets of stable set polytopes of circular interval graphs
- Generalized network design polyhedra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4078069)
