AbstractThis paper gives an elementary, inductive proof-“graphical” in spirit-of a theorem of Edmonds' which specifies the convex hull of the matchings of an arbitrary, finite, undirected graph in terms of a finite system of linear inequalities
AbstractGiven a graph G = (V,E) and an integer vector bϵNv, a b-matching is a set of edges F⊂E such ...
AbstractWe give a polyhedral characterization of line graphs that, in some sense, gives a converse t...
Rapport interne.We give a linear characterization of the convex hull of the disjunction of polymatro...
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 perfect matching polytope of a graph G is the convex hull of the set of incidence vector...
The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of per...
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchi...
AbstractThe matching polyhedron, i.e., the convex hull of (incidence vectors of) perfect matchings o...
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...
We just give the definitions and characterisations needed. More background can be found in the treat...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
AbstractAs shown in [D. Hoffman, H. Jordon, Signed graph factors and degree sequences, J. Graph Theo...
ABSTRACT. The purpose of this paper is to present a short, self-contained proof of Euler’s relation....
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 ...
AbstractWe give a polyhedral characterization of line graphs that, in some sense, gives a converse t...
Rapport interne.We give a linear characterization of the convex hull of the disjunction of polymatro...
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 perfect matching polytope of a graph G is the convex hull of the set of incidence vector...
The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of per...
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchi...
AbstractThe matching polyhedron, i.e., the convex hull of (incidence vectors of) perfect matchings o...
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...
We just give the definitions and characterisations needed. More background can be found in the treat...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
AbstractAs shown in [D. Hoffman, H. Jordon, Signed graph factors and degree sequences, J. Graph Theo...
ABSTRACT. The purpose of this paper is to present a short, self-contained proof of Euler’s relation....
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 ...
AbstractWe give a polyhedral characterization of line graphs that, in some sense, gives a converse t...
Rapport interne.We give a linear characterization of the convex hull of the disjunction of polymatro...
DOI
Add to ORKG