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

Square-free perfect graphs

Conforti, M, Cornuejols, G and Vuskovic, K (2004) Square-free perfect graphs. Journal of Combinatorial Theory: Series B, 90 (2). 257 - 307 . ISSN 0095-8956

Full text available as:
[img]
Preview
Text
squarefree.pdf
Available under licence : See the attached licence file.

Download (429Kb)

Abstract

We prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite graphs or have a 2-join or a star cutset.

Item Type: Article
Copyright, Publisher and Additional Information: © 2004, Elsevier. This is an author produced version of a paper published in Journal of Combinatorial Theory, Series B. Uploaded in accordance with the publisher's self-archiving policy.
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: 25 Jun 2012 09:19
Last Modified: 09 Jun 2014 16:09
Published Version: http://dx.doi.org/10.1016/j.jctb.2003.08.003
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.jctb.2003.08.003
URI: http://eprints.whiterose.ac.uk/id/eprint/74358

Actions (login required)

View Item View Item