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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
