Name
Abstract | ||
|---|---|---|
The repetition threshold is the smallest real number alpha such that there exists an infinite word over a k-letter alphabet that avoids repetition of exponent strictly greater than alpha. This notion can be generalized to graph classes. In this paper, we completely determine the repetition thresholds for caterpillars and caterpillars of maximum degree 3. Additionally, we present bounds for the repetition thresholds of trees with bounded maximum degrees. |
Year | Venue | Keywords |
|---|---|---|
2018 | ELECTRONIC JOURNAL OF COMBINATORICS | Infinite word,Repetition threshold,Graph coloring |
DocType | Volume | Issue |
Journal | 25 | 1 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Borut Luzar | 1 | 42 | 10.86 |
| Pascal Ochem | 2 | 258 | 36.91 |
| Alexandre Pinlou | 3 | 167 | 20.47 |