On Steiner 2-edge connected polytopes

In this paper, we study the Steiner 2-edge connected subgraph polytope. We introduce a large class of valid inequalities for this polytope called generalized Steiner -P-partition inequalities, that generalize the so-called Steiner F-partition inequalities. We show that these inequalities together with the trivial and the Steiner cuts inequalities completely describe the polytope when the graph is a wheel. Using this, we discuss some applications to Halin graphs.