Arborescence polytopes for series-parallel graphs (Q1329787): Difference between revisions

A graph is called series-parallel if it does not contain any subgraph homeomorphic to the complete graph on 4 vertices. For a directed graph whose underlying graph is series-parallel, an \(r\)-arborescence is defined as a tree directed away from the root vertex \(r\). Given a set of terminals, a Steiner arborescence is an \(r\)-arborescence spanning this set. Associated with these arborescences the author defines the convex hulls of incidence vectors and characterizes these polytopes completely by linear inequalities.