Recognizing Berge Graphs

A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|<sup>9</sup>). This is independent of the recent proof of the strong perfect graph conjecture.