Repetition thresholds for subdivided graphs and trees
From MaRDI portal
Publication:2911431
DOI10.1051/ita/2011122zbMath1247.68211OpenAlexW2052807252MaRDI QIDQ2911431
Publication date: 31 August 2012
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222007
Trees (05C05) Combinatorics on words (68R15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Fractional meanings of nonrepetitiveness ⋮ Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ The weak circular repetition threshold over large alphabets
Cites Work
This page was built for publication: Repetition thresholds for subdivided graphs and trees