Finding an even hole in a graph
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vušković · 2002
A hole in a graph is a chordless cycle of length greater than three. In this paper we present a decomposition theorem for graphs that contain no even hole. This theorem yields a polytime algorithm to recognize whether a graph contains an even hole.