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
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.
|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:||18 Sep 2016 06:17|