Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly

Laurent Beaudou, Caroline Brosse, Oscar Defrain +4

The Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $σ= v_1,\dots,v_…