ThesisToole, AlexA repetition-free coloring of a graph is a coloring of its vertices such that there are no paths for which the color pattern on the first half is repeated on the second half. The Thue chromatic number of a graph is the minimum number of colors require . . .
ThesisReeves, TonyaA repetition is a sequence of symbols in which the first half is the same as the second half. An edge-coloring of a graph is repetition-free if there is no path with a color pattern that is a repetition. The minimum number of colors so that a graph ha . . .