Pattern avoidance on graphs
Tài liệu tham khảo
J.-P. Allouche, J. Shallit, The ubiquitous Prouhet–Thue–Morse sequence, Sequences and their applications (Singapore, 1998), Springer Series in Discrete Mathematics and Theoretical Computer Science, Springer, London, 1999, pp. 1–16
Alon, 2002, Non-repetitive colorings of graphs, Random Struct. Alg., 21, 336, 10.1002/rsa.10057
Alon, 2000
Baker, 1989, Growth problems for avoidable words, Theoret. Comput. Sci.,, 69, 319, 10.1016/0304-3975(89)90071-6
Bean, 1979, Avoidable patterns in strings of symbols, Pacific J. Math., 85, 261, 10.2140/pjm.1979.85.261
Choffrut, 1997, Combinatorics of Words, 329
Currie, 1993, Open problems in pattern avoidance, Amer. Math. Monthly, 100, 790, 10.2307/2324790
J.D. Currie, Words avoiding patterns: open problems, manuscript.
Dekking, 1974, Strongly non-repetitive sequences and progression free sets, J. Combin. Theory Ser. A, 16, 159
Gottschalk, 1964, A characterization of the Morse minimal set, Proc. Amer. Math. Soc., 15, 70, 10.1090/S0002-9939-1964-0158386-X
Grytczuk, 2002, Pattern avoiding colorings of Euclidean spaces, Ars Combin., 64, 109
Grytczuk, 2003, Non-repetitive colorings of infinite sets, Discrete Math., 265, 365, 10.1016/S0012-365X(02)00879-8
Larson, 1980, Square-free and cube-free colorings of the ordinals, Pacific J. Math., 89, 137, 10.2140/pjm.1980.89.137
Lothaire, 1983
M. Lothaire, Algebraic Combinatoric on Words, Cambridge, 2001.
Mauduit, 2001, Multiplicative properties of the Thue-Morse sequence, Periodica Math. Hungar, 43, 137, 10.1023/A:1015241900975
Molloy, 2002, vol. 23
Morse, 1921, A one-to-one representation of geodesics on a surface of negative curvature, Amer. J. Math., 43, 35, 10.2307/2370306
Novikov, 1959, On periodic groups, Dokl. Akad. Nauk SSSR, 127, 749
Pleasants, 1970, Non-repetitive sequences, Proc. Cambridge Philos. Soc., 68, 267, 10.1017/S0305004100046077
Prouhet, 1851, Memoire sur quelques relations entre les puissances des nombres, C. R. Acad. Sci. Paris, 33, 31
Queffelec, 1987, vol. 1294
Thue, 1906, Über unendliche Zeichenreichen, Norske Vid Selsk. Skr. I. Mat. Nat. Kl. Christiana,, 7, 1
Zimin, 1982, Blocking sets of terms, Mat. Sb. (NS), 119, 363