Repetition thresholds for subdivided graphs and trees

DOI10.1051/ITA/2011122zbMath1247.68211OpenAlexW2052807252MaRDI QIDQ2911431

Pascal Ochem, Elise Vaslet

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

zbMATH Keywords

combinatorics on wordsrepetition thresholdsquare-free coloring

Mathematics Subject Classification ID

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 (5)

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

• Nonrepetitive colorings of graphs -- a survey
• Non-repetitive 3-coloring of subdivided graphs
• There exist binary circular \(5/2^+\) power free words of every length
• Sur un théorème de Thue
• A generator of morphisms for infinite words
• Dejean's conjecture and letter frequency

This page was built for publication: Repetition thresholds for subdivided graphs and trees