Skip to main content
SpringerLink
Log in

Perfect Graphs, Partitionable Graphs and Cutsets

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

We prove a theorem about cutsets in partitionable graphs that generalizes earlier results on amalgams, 2-amalgams and homogeneous pairs.

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.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Università di Padova; Via Belzoni 7, 35131 Padova, Italy; E-mail: Conforti@math.unipd.it, , , , , , IT

    Michele Conforti

  2. Carnegie Mellon University; Schenley Park, Pittsburgh, PA 15213 USA; E-mail: gc0v@andrew.cmu.edu, , , , , , US

    Gérard Cornuéjols

  3. Yerevan State University; 1 A. Manoogian st. 357049 Yerevan, Armenia; E-mail: Grigor@freenet.am, , , , , , AM

    Grigor Gasparyan

  4. School of Computing, University of Leeds; Leeds, LS2 9JT England; E-mail: vuskovi@comp.leeds.ac.uk, , , , , , GB

    Kristina Vušković

Authors
  1. Michele Conforti
    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. Grigor Gasparyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kristina Vušković
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received December 13, 1999

RID="*"

ID="*" This work was supported in part by the Fields Institute for Research in Mathematical Sciences, Toronto, Canada, and by NSF grants DMI-0098427 and DMI-9802773 and ONR grant N00014-97-1-0196.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conforti, M., Cornuéjols, G., Gasparyan, G. et al. Perfect Graphs, Partitionable Graphs and Cutsets. Combinatorica 22, 19–33 (2002). https://doi.org/10.1007/s004930200001

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930200001

Search

Navigation