This is the latest version of this eprint.
Chudnovsky, M, Cornuejols, G, Liu, X et al. (2 more authors) (2005) Recognizing Berge graphs. Combinatorica, 25 (2). 143 - 186 . ISSN 0209-9683
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.
|Institution:||The University of Leeds|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)|
|Depositing User:||Symplectic Publications|
|Date Deposited:||18 Jun 2012 14:39|
|Last Modified:||04 Nov 2016 00:36|
Available Versions of this Item
Recognizing Berge graphs. (deposited 18 Jun 2012 14:34)
- Recognizing Berge graphs. (deposited 18 Jun 2012 14:39) [Currently Displayed]