Date of Original Version

2-2002

Type

Article

Abstract or Description

We present an algorithm that determines in polytime whether a graph contains an even hole. The algorithm is based on a decomposition theorem for even-hole-free graphs obtained in Part I of this work. We also give a polytime algorithm to find an even hole in a graph when one exists.

DOI

10.1002/jgt.10045

Share

COinS
 

Published In

Journal of Graph Theory , 40, 4, 238-266.