5 citations · 5 across the 1 of their papers we have counts for
1 paper
Michel Burlet, Frédéric Maffray, Nicolas Trotignon
A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equ…