Even-hole-free graphs, Part I: Decomposition Theorem

Conforti, M, Cornuejols, G, Kapoor, A and Vuskovic, K (2002) Even-hole-free graphs, Part I: Decomposition Theorem. Journal of Graph Theory, 39 (1). 6 - 49 . ISSN 0364-9024

Full text available as:

Preview

Text decomp-even.pdf Available under License : See the attached licence file. Download (366Kb)

Abstract

We prove a decomposition theorem for even-hole-free graphs. The decompositions used are 2-joins and star, double-star and triple-star cutsets. This theorem is used in the second part of this paper to obtain a polytime recognition algorithm for even-hole-free graphs.

Item Type:	Article
Copyright, Publisher and Additional Information:	© 2002, Wiley Blackwell. This is an author produced version of a paper published in Journal of Graph Theory. Uploaded in accordance with the publisher's self-archiving policy. The definitive version is available at www3.interscience.wiley.com.
Academic Units:	The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User:	Symplectic Publications
Date Deposited:	22 Jun 2012 11:23
Last Modified:	08 Feb 2013 17:39
Published Version:	http://dx.doi.org/10.1002/jgt.10006
Status:	Published
Publisher:	Wiley Blackwell
Identification Number:	10.1002/jgt.10006
URI:	http://eprints.whiterose.ac.uk/id/eprint/74361

Actions (login required)

View Item