Optimal b-Colourings and Fall Colourings in $H$-Free Graphs

Jungho Ahn, Tala Eagling-Vose, Felicia Lucke +3

In a colouring of a graph, a vertex is b-chromatic if it is adjacent to a vertex of every other colour. We consider four well-studied colouring problems: b-Chromatic Number, Tight…