Trotignon, Nicolas - HAL - 2005
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its … saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky …
