All Articles tagged nonrepetitive colouring
Structural graph theory
March 06, 2020 EDT A universal upper bound on the number of colours needed to colour vertices of any planar graph such that no path divides into two parts with the same colour pattern.