A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Some results in square-free and strong square-free edge-colorings of graphs
2007
Discrete Mathematics
The set of problems we consider here are generalizations of square-free sequences [A. Thue, Über unendliche Zeichenreichen, Norske Vid Selsk. Skr. I. Mat. Nat. Kl. Christiana 7 (1906) 1-22]. A finite sequence a 1 a 2 . . . a n of symbols from a set S is called square-free if it does not contain a sequence of the form ww = as a subsequence of consecutive terms. Extending the above concept to graphs, a coloring of the edge set E in a graph G(V , E) is called square-free if the sequence of colors
doi:10.1016/j.disc.2006.09.019
fatcat:cxn6zvmxabgejbvgaadtcxwlgi