Advanced Search
MyIDEAS: Login

A new decomposition theorem for Berge graphs

Contents:

Author Info

  • Nicolas Trotignon

    ()
    (CERMSEM)

Registered author(s):

    Abstract

    A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky proved a stronger theorem by restricting the allowed decompositions. We prove here a stronger theorem by restricting again the allowed decompositions. Motivation for this new theorem will be given in a work in preparation.

    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/cahiers2005/B05079.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Université Panthéon-Sorbonne (Paris 1) in its series Cahiers de la Maison des Sciences Economiques with number b05079.

    as in new window
    Length: 26 pages
    Date of creation: Nov 2005
    Date of revision:
    Handle: RePEc:mse:wpsorb:b05079

    Contact details of provider:
    Postal: 106 - 112 boulevard de l'Hôpital, 75647 Paris cedex 13
    Phone: 01 44 07 81 00
    Fax: 01 44 07 81 09
    Email:
    Web page: http://mse.univ-paris1.fr/
    More information through EDIRC

    Related research

    Keywords: Graph; Berge; decomposition; 2-join; skew partition.;

    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:wpsorb:b05079. 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.