Date of Original Version

5-20-2004

Type

Article

Abstract or Description

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.

DOI

10.1007/s00493-005-0012-8

Share

COinS
 

Published In

Combinatorica, 25, 2, 143-186.