Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

Registered author(s):

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: ftp://mse.univ-paris1.fr/pub/mse/CES2008/B08021.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne in its series Documents de travail du Centre d'Economie de la Sorbonne with number b08021.

    as in new window
    Length: 43 pages
    Date of creation: Mar 2008
    Date of revision:
    Handle: RePEc:mse:cesdoc:b08021

    Contact details of provider:
    Postal: 106-112 boulevard de l'Hôpital 75 647 PARIS CEDEX 13
    Phone: + 33 44 07 81 00
    Fax: + 33 1 44 07 83 01
    Web page: http://centredeconomiesorbonne.univ-paris1.fr/
    More information through EDIRC

    Related research

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

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

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

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.