IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-29210-1_8.html
   My bibliography  Save this book chapter

The stable set polytope of claw-free graphs with stability number greater than three

In: Operations Research Proceedings 2011

Author

Listed:
  • Anna Galluccio

    (Consiglio Nazionale delle Ricerche)

  • Claudio Gentile

    (Consiglio Nazionale delle Ricerche)

  • Paolo Ventura

    (Consiglio Nazionale delle Ricerche)

Abstract

In 1965 Edmonds gave the first complete polyhedral description for a combinatorial optimization problem: the Matching polytope. Many researchers tried to generalize his result by considering the Stable Set polytope of claw-free graphs. However this is still an open problem. Here we solve it for the class of claw-free graphs with stability number greater than 3 and without 1-joins.

Suggested Citation

  • Anna Galluccio & Claudio Gentile & Paolo Ventura, 2012. "The stable set polytope of claw-free graphs with stability number greater than three," Operations Research Proceedings, in: Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), Operations Research Proceedings 2011, edition 127, pages 47-52, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-29210-1_8
    DOI: 10.1007/978-3-642-29210-1_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-642-29210-1_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.