IDEAS home Printed from https://ideas.repec.org/p/mse/wpsorb/b06085.html
   My bibliography  Save this paper

Algorithms for square-3PC(.,.)-free Berge graphs

Author

Listed:
  • Frédéric Maffray

    (Laboratoire Leibniz)

  • Nicolas Trotignon

    (CEntre de Recherche en Mathématiques, Statistique et Economie Mathématique (CERMSEM))

  • Kristina Vuskovic

    (University of Leeds)

Abstract

We consider the class of graphs containing no odd hole, no odd antihole and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole and at least two of the paths are of length 2. This class generalizes claw-free Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity O(n7) to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class

Suggested Citation

  • Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Cahiers de la Maison des Sciences Economiques b06085, Université Panthéon-Sorbonne (Paris 1).
    • Handle: RePEc:mse:wpsorb:b06085
    DOI: 10.1137/050628520
    as

    Download full text from publisher

    File URL: https://halshs.archives-ouvertes.fr/halshs-00130439
    Download Restriction: no
    File URL: https://doi.org/10.1137/050628520
    Download Restriction: no
    File URL: https://libkey.io/10.1137/050628520?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. HSU, Wen-Lian & NEMHAUSER, George L., 1984. "Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs," LIDAM Reprints CORE 595, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Xueliang Li & Wenan Zang, 2005. "A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs," Journal of Combinatorial Optimization, Springer, vol. 9(4), pages 331-347, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frédéric Maffray & Nicolas Trotignon & Kristina Vuskovic, 2006. "Algorithms for square-3PC(.,.)-free Berge graphs," Post-Print halshs-00130439, HAL.
    2. Xueliang Li & Wenan Zang, 2005. "A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs," Journal of Combinatorial Optimization, Springer, vol. 9(4), pages 331-347, June.
    3. Vadim Lozin & Christopher Purcell, 2014. "Coloring vertices of claw-free graphs in three colors," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 462-479, August.

    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:mse:wpsorb:b06085. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Lucie Label (email available below). General contact details of provider: https://edirc.repec.org/data/msep1fr.html .

    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.