Abstract
Abstract 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
