Non-repetitive 3-coloring of subdivided graphs
From MaRDI portal
Publication:1028809
zbMath1165.05325MaRDI QIDQ1028809
Michał Zmarz, Andrzej Pezarski
Publication date: 8 July 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130283
Related Items (8)
Repetition thresholds for subdivided graphs and trees ⋮ Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ New bounds for facial nonrepetitive colouring ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Nonrepetitive colouring via entropy compression ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ Facial non-repetitive edge-coloring of plane graphs ⋮ Nonrepetitive list colourings of paths
This page was built for publication: Non-repetitive 3-coloring of subdivided graphs
