Vuskovic, K (2010) Even-Hole-Free Graphs: A Survey. Applicable Analysis and Discrete Mathematics, 4 (2). 219 - 240 . ISSN 1452-8630Full text available as:
Available under licence : See the attached licence file.
The class of even-hole-free graphs is structurally quite similar to the class of perfect graphs, which was the key initial motivation for their study. The techniques developed in the study of even-hole-free graphs were generalized to other complex hereditary graph classes, and in the case of perfect graphs led to the famous resolution of the Strong Perfect Graph Conjecture and their polynomial time recognition. The class of even-hole-free graphs is also of independent interest due to its relationship to beta-perfect graphs. In this survey we describe all the different structural characterizations of even-hole-free graphs, focusing on their algorithmic consequences.
|Copyright, Publisher and Additional Information:||© 2010, University of Belgrade & Academic Mind. Reproduced with permission from the publisher.|
|Keywords:||Even-hole-free graphs, combinatorial optimization, beta-perfect graphs, recognition algorithm, decomposition, beta-perfect graphs, berge graphs, recognition algorithm, balanced matrices, odd holes, decomposition, matroids, theorem|
|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:||22 Jun 2012 08:23|
|Last Modified:||09 Jun 2014 05:22|
|Publisher:||University of Belgrade & Academic Mind|