Colourful components in $k$-caterpillars and planar graphs

Janka Chlebíková, Clément Dallard

A connected component of a vertex-coloured graph is said to be colourful if all its vertices have different colours. By extension, a graph is colourful if all its connected compone…