On the spanning tree polyhedron (Q1122482)

Given an arbitrary simple finite graph, we can define the convex hull of the incidence vectors of all spanning trees. The paper gives an alternative proof of a theorem of Fulkerson, which gives an inequality representation of the above-defined polyhedron. The proof depends on an easy spanning-tree algorithm applied to the original graph. Using a lemma that says that for a 2-connected graph for arbitrary two edges, there exist two spanning trees which differ exactly in these two edges; also the facets of the polyhedron are characterized.