Thue type problems for graphs, points, and numbers

From MaRDI portal
Publication:941381

DOI10.1016/j.disc.2007.08.039zbMath1160.05036OpenAlexW2075720344MaRDI QIDQ941381

Jarosław Grytczuk

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.039




Related Items (35)

Fractional meanings of nonrepetitivenessOn the facial Thue choice number of plane graphs via entropy compression methodAnagram-Free Colourings of GraphsA note on the thue chromatic number of lexicographic products of graphsAvoiding Three Consecutive Blocks of the Same Size and Same SumLayered separators in minor-closed graph classes with applicationsString Powers in TreesString powers in treesOn avoding \(r\)-repetitions in \(\mathbb R^2\)Thue choosability of treesOn the facial Thue choice index of plane graphsExtensions and reductions of squarefree wordsFrom the 1-2-3 conjecture to the Riemann hypothesisCharacterisations and examples of graph classes with bounded expansionRestricted coloring problems on graphs with few \(P_4\)'sNonrepetitive colorings of graphs of bounded tree-widthNonrepetitive colorings of line arrangementsNew approach to nonrepetitive sequencesWords avoiding repetitions in arithmetic progressionsNonrepetitive colouring via entropy compressionGrasshopper avoidance of patternsNonrepetitive list colorings of the integersFacial non-repetitive edge-coloring of plane graphsHighly nonrepetitive sequences: Winning strategies from the local lemmaNonrepetitive list colourings of pathsNonrepetitive and pattern-free colorings of the planeThe complexity of nonrepetitive coloringAvoiding Multiple Repetitions in Euclidean SpacesSplitting necklaces and measurable colorings of the real lineExtremal square-free wordsNonrepetitive colorings of graphsTotal Thue colourings of graphsPermutations destroying arithmetic structureHow to play Thue gamesRepetitions in Toeplitz words and the Thue threshold



Cites Work


This page was built for publication: Thue type problems for graphs, points, and numbers