The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd antihole is a perfect graph (since the clique number of an antihole with 2k + 1 vertices is k and its chromatic number is k + 1).

Berge graph | chordless cycle | graph cycle | graph hole | strong perfect graph theorem