Recognizing Berge Graphs
- Cite this article as:
- Chudnovsky*, M., Cornuéjols**, G., Liu†, X. et al. Combinatorica (2005) 25: 143. doi:10.1007/s00493-005-0012-8
- 229 Downloads
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.