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

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

Author

Listed:

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 Vuškovi?, 2008. "A structure theorem for graphs with no cycle with a unique chord and its consequences," Documents de travail du Centre d'Economie de la Sorbonne b08021, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
  • Handle: RePEc:mse:cesdoc:b08021
    as

    Download full text from publisher

    File URL: ftp://mse.univ-paris1.fr/pub/mse/CES2008/B08021.pdf
    Download Restriction: no

    More about this item

    Keywords

    Cycle with a unique chord; decomposition; structure; detection; recognition; Heawood graph; Petersen graph; coloring.;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:cesdoc:b08021. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lucie Label). General contact details of provider: http://edirc.repec.org/data/cenp1fr.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.