Skip to main content
SpringerLink
Log in

Recognizing Berge Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|9). This is independent of the recent proof of the strong perfect graph conjecture.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Mathematics Dept, Princeton University, Fine Hall, Washington Rd, Princeton, NJ 08544, USA

    Maria Chudnovsky*

  2. Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA

    Gérard Cornuéjols**

  3. Laboratoire d’Informatique, Fondamentale Faculté des Sciences de Luminy, 13288, Marseille, France

    Gérard Cornuéjols**

  4. Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213, USA

    Xinming Liu†

  5. Mathematics Dept, Princeton University, Fine Hall, Washington Rd, Princeton, NJ 08544, USA

    Paul Seymour†

  6. School of Computing, University of Leeds, Leeds LS2 9JT, UK

    Kristina Vušković‡

Authors
  1. Maria Chudnovsky*
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gérard Cornuéjols**
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xinming Liu†
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paul Seymour†
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kristina Vušković‡
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maria Chudnovsky*.

Additional information

* Currently this author is a Clay Mathematics Institute Research Fellow.

** Supported by NSF grant DMI-0352885 and ONR grant N00014-97-1-0196.

† Supported by ONR grant N00014-01-1-0608, and NSF grant DMS-0070912.

‡ Supported by EPSRC grant GR/R35629/01.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chudnovsky*, M., Cornuéjols**, G., Liu†, X. et al. Recognizing Berge Graphs. Combinatorica 25, 143–186 (2005). https://doi.org/10.1007/s00493-005-0012-8

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-005-0012-8

Mathematics Subject Classification (2000):

Search

Navigation