Nonrepetitive colorings of lexicographic product of graphs
Nonrepetitive colorings of lexicographic product of graphs
Special issue PRIMA 2013 A coloring c of the vertices of a graph G is nonrepetitive if there exists no path v1v2\textellipsisv2l for which c(vi)=c(vl+i) for all 1<=i<=l. Given graphs G and H with |V(H)|=k, the lexicographic product G[H] is the graph obtained by substituting every vertex of G by …