IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00265957.html
   My bibliography  Save this paper

A structure theorem for graphs with no cycle with a unique chord and its consequences

Author

Listed:
  • Nicolas Trotignon

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Kristina Vuskovic

    (School of Computing [Leeds] - University of Leeds)

Abstract

We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition. Basic classes are cliques, bipartite graphs with one side containing only nodes of degree two and induced subgraph of the famous Heawood or Petersen graph. Decompositions are node cutsets consisting of one or two nodes and edge cutsets called 1-joins. Our decomposition theorem actually gives a complete structure theorem for C, i.e. every graph in C can be built from basic graphs that can be explicitly constructed, and gluing them together by prescribed composition operations ; and all graphs built this way are in C. This has several consequences : an O(nm)-time algorithm to decide whether a graph is in C, an O(n+m)-time algorithm that finds a maximum clique of any graph in C and an O(nm)-time coloring algorithm for graphs in C. We prove that every graph in C is either 3-colorable or has a coloring with ω colors where ω is the size of a largest clique. The problem of finding a maximum stable set for a graph in C is known to be NP-hard.

Suggested Citation

  • Nicolas Trotignon & Kristina Vuskovic, 2008. "A structure theorem for graphs with no cycle with a unique chord and its consequences," Post-Print halshs-00265957, HAL.
    • Handle: RePEc:hal:journl:halshs-00265957
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00265957
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00265957/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Benjamin Lévèque & David Y. Lin & Fr d ric Maffray & Nicolas Trotignon, 2007. "Detecting induced subgraphs," Documents de travail du Centre d'Economie de la Sorbonne b07049, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    2. Benjamin Lévêque & David Y. Lin & Frédéric Maffray & Nicolas Trotignon, 2007. "Detecting induced subgraphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00180953, HAL.
    3. Benjamin Lévêque & David Y. Lin & Frédéric Maffray & Nicolas Trotignon, 2007. "Detecting induced subgraphs," Post-Print halshs-00180953, HAL.
    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. Nicolas Derhy & Christophe Picouleau & Nicolas Trotignon, 2008. "The four-in-a-tree problem in triangle-free graphs," Post-Print halshs-00270623, HAL.
    2. Benjamin Lévêque & Frédéric Maffray & Nicolas Trotignon, 2007. "On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph," Post-Print halshs-00180961, HAL.

    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:hal:journl:halshs-00265957. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.