%0 Journal Article %A Chudnovsky, Maria %A Cornuejols, Gerard %A Liu, Xinming %A Seymour, Paul %A Vušcović, Kristina %D 1991 %T Recognizing Berge Graphs %U https://kilthub.cmu.edu/articles/journal_contribution/Recognizing_Berge_Graphs/6707654 %R 10.1184/R1/6707654.v1 %2 https://kilthub.cmu.edu/ndownloader/files/12236726 %K Business %K Management %X 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)|9). This is independent of the recent proof of the strong perfect graph conjecture. %I Carnegie Mellon University