AbstractA short proof of Edmonds' matching polyhedron theorem and the total dual integrality of the associated system of linear inequalities, proved first by W. H. Cunningham and A. B. Marsh (Math. Programming Stud. 8 (1978), 50–72), is given
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractCunningham and Geelen introduced the independent path-matching problem as a common generaliz...
AbstractWe give a polyhedral characterization of line graphs that, in some sense, gives a converse t...
AbstractThis paper gives an elementary, inductive proof-“graphical” in spirit-of a theorem of Edmond...
AbstractA short proof of Edmonds' matching polyhedron theorem and the total dual integrality of the ...
AbstractThe matching polyhedron, i.e., the convex hull of (incidence vectors of) perfect matchings o...
AbstractThe perfect matching polytope of a graph G is the convex hull of the set of incidence vector...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of per...
AbstractLet S be a set of linear inequalities that determine a bounded polyhedron P. The closure of ...
AbstractGiven a graph G = (V,E) and an integer vector bϵNv, a b-matching is a set of edges F⊂E such ...
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchi...
Given a graph G=(V,E), a subset M of E is called a matching if no two edges in M are adjacent. A mat...
AbstractFor a given graph G(V,E) and a given vector x∈Rv the problem of finding a hyperplane which s...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractCunningham and Geelen introduced the independent path-matching problem as a common generaliz...
AbstractWe give a polyhedral characterization of line graphs that, in some sense, gives a converse t...
AbstractThis paper gives an elementary, inductive proof-“graphical” in spirit-of a theorem of Edmond...
AbstractA short proof of Edmonds' matching polyhedron theorem and the total dual integrality of the ...
AbstractThe matching polyhedron, i.e., the convex hull of (incidence vectors of) perfect matchings o...
AbstractThe perfect matching polytope of a graph G is the convex hull of the set of incidence vector...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of per...
AbstractLet S be a set of linear inequalities that determine a bounded polyhedron P. The closure of ...
AbstractGiven a graph G = (V,E) and an integer vector bϵNv, a b-matching is a set of edges F⊂E such ...
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchi...
Given a graph G=(V,E), a subset M of E is called a matching if no two edges in M are adjacent. A mat...
AbstractFor a given graph G(V,E) and a given vector x∈Rv the problem of finding a hyperplane which s...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractCunningham and Geelen introduced the independent path-matching problem as a common generaliz...
AbstractWe give a polyhedral characterization of line graphs that, in some sense, gives a converse t...
DOI
Add to ORKG