Nonrepetitive colorings of graphs
From MaRDI portal
Publication:4798171
DOI10.1002/rsa.10057zbMath1018.05032OpenAlexW2082905402MaRDI QIDQ4798171
Mariusz Hałuszczak, Jarosław Grytczuk, Oliver Riordan, Noga Alon
Publication date: 19 March 2003
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10057
Related Items (70)
On the facial Thue choice number of plane graphs via entropy compression method ⋮ \((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ Anagram-Free Colourings of Graphs ⋮ A note on the thue chromatic number of lexicographic products of graphs ⋮ The complexity of unavoidable word patterns ⋮ Nonrepetitive colorings of trees ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A fast algorithm for the product structure of planar graphs ⋮ Layered separators in minor-closed graph classes with applications ⋮ Pattern avoidance on graphs ⋮ Some results in square-free and strong square-free edge-colorings of graphs ⋮ Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ New bounds for facial nonrepetitive colouring ⋮ A General Framework for Hypergraph Coloring ⋮ Avoiding squares over words with lists of size three amongst four symbols ⋮ Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ Anagram-free colorings of graphs ⋮ Thue choosability of trees ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ Uniformly recurrent subgroups and simple \(C^{\ast}\)-algebras ⋮ The product structure of squaregraphs ⋮ A note about online nonrepetitive coloring \(k\)-trees ⋮ Almost quasi-isometries and more non-C*-exact groups ⋮ Graph product structure for non-minor-closed classes ⋮ Fractional Thue chromatic number of graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Growth properties of power-free languages ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Nonrepetitive vertex colorings of graphs ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Realization of aperiodic subshifts and uniform densities in groups ⋮ Restricted coloring problems on graphs with few \(P_4\)'s ⋮ Thue type problems for graphs, points, and numbers ⋮ Nonrepetitive colorings of graphs of bounded tree-width ⋮ Nonrepetitive colorings of line arrangements ⋮ Pathwidth and nonrepetitive list coloring ⋮ New approach to nonrepetitive sequences ⋮ Every plane graph is facially-non-repetitively \(C\)-choosable ⋮ Anagram-free graph colouring ⋮ Breaking the rhythm on graphs ⋮ Nonrepetitive colouring via entropy compression ⋮ Pattern avoidance: themes and variations ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ Nonrepetitive list colorings of the integers ⋮ Building large free subshifts using the Local Lemma ⋮ Nonrepetitive and pattern-free colorings of the plane ⋮ The complexity of nonrepetitive coloring ⋮ Avoiding Multiple Repetitions in Euclidean Spaces ⋮ Splitting necklaces and measurable colorings of the real line ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Generalised colouring sums of graphs ⋮ Notes on graph product structure theory ⋮ Nonrepetitive colorings of graphs ⋮ Nonrepetitive colorings of graphs ⋮ Negative curvature in graphical small cancellation groups ⋮ Measurable versions of the Lovász local lemma and measurable graph colorings ⋮ Small cancellation theory over Burnside groups ⋮ A generalization of the simulation theorem for semidirect products ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ Optimal strong parity edge-coloring of complete graphs ⋮ Facial Nonrepetitive Vertex Coloring of Plane Graphs ⋮ Total Thue colourings of graphs ⋮ How to play Thue games ⋮ On a generalization of Thue sequences ⋮ The weak circular repetition threshold over large alphabets ⋮ The local cut lemma
Cites Work
This page was built for publication: Nonrepetitive colorings of graphs
