Nonrepetitive graph colouring

DOI10.37236/9777zbMath1486.05108arXiv2009.02001OpenAlexW3198979447MaRDI QIDQ2122918

David R. Wood

Publication date: 7 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.02001

zbMATH Keywords

bounded degree graphswalk-nonrepetitive colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ Avoiding squares over words with lists of size three amongst four symbols ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The product structure of squaregraphs ⋮ Graph product structure for non-minor-closed classes

This page was built for publication: Nonrepetitive graph colouring