New lower bounds on the non-repetitive chromatic number of some graphs

Tianyi Tao, Junchi Zhang, Wentao Zhang +1

A graph \( G \) is said to be (vertex) non-repetitively colored if no simple path in \( G \) has a sequence of vertex colors that forms a repetition. Formally, a coloring \( c: V(G…