White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Perfect graphs, partitionable graphs and cutsets

Conforti, M, Cornuejols, G, Gasparyan, G and Vuskovic, K (2002) Perfect graphs, partitionable graphs and cutsets. Combinatorica, 22 (1). 19 - 33 . ISSN 0209-9683


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

Item Type: Article
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 18 Jun 2012 15:44
Last Modified: 15 Sep 2014 03:39
Published Version: http://dx.doi.org/10.1007/s004930200001
Status: Published
Publisher: Springer Verlag
Identification Number: 10.1007/s004930200001
URI: http://eprints.whiterose.ac.uk/id/eprint/74362

Actions (repository staff only: login required)