Sign in

The facets of the spanning trees polytope

By Brahim Chaourar
Let G=(V,E)G=(V, E) be an undirected graph. The spanning trees polytope P(G)P(G) is the convex hull of the all spanning trees of GG. In this paper, we describe all facets of P(G)P(G) as a consequence of the facets of the bases polytope of a matroid.
October 13, 2019
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
The facets of the spanning trees polytope
Click on play to start listening