Which graphs allow infinite nonrepetitive walks?
From MaRDI portal
Publication:2639070
DOI10.1016/0012-365X(91)90134-NzbMath0718.05030MaRDI QIDQ2639070
Publication date: 1991
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (8)
On the structure and extendibility of \(k\)-power free words ⋮ Unnamed Item ⋮ Non-repetitive words: Ages and essences ⋮ On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\) ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Thue type problems for graphs, points, and numbers ⋮ Nonrepetitive colorings of graphs ⋮ On a generalization of Thue sequences
Cites Work
- Avoidable patterns in strings of symbols
- Embedding the dual of \(\Pi^\infty\) in the lattice of equational classes of semigroups.
- Unending chess, symbolic dynamics and a problem in semi-groups
- Aperiodic words on three symbols.
- Aperiodic words on three symbols. II.
- INFINITE PERIODIC GROUPS. I
- Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Which graphs allow infinite nonrepetitive walks?