Nonrepetitive vertex colorings of graphs

DOI10.1016/j.disc.2011.09.027zbMath1233.05103OpenAlexW1997528646MaRDI QIDQ658062

Jochen Harant, Stanlislav Jendroľ

Publication date: 11 January 2012

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

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

zbMATH Keywords

Thue chromatic numberfacial Thue chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

On the facial Thue choice number of plane graphs via entropy compression method ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Layered separators in minor-closed graph classes with applications ⋮ 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 ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ Fractional Thue chromatic number of graphs ⋮ Pathwidth and nonrepetitive list coloring ⋮ Anagram-free graph colouring ⋮ Nonrepetitive colouring via entropy compression ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ Facial Nonrepetitive Vertex Coloring of Plane Graphs ⋮ The local cut lemma

Cites Work

• Unnamed Item
• Nonrepetitive colorings of trees
• The structure of 1-planar graphs
• Nonrepetitive colorings of graphs -- a survey
• Nonrepetitive colorings of graphs of bounded tree-width
• Graphs drawn with few crossings per edge
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Facial non-repetitive edge-coloring of plane graphs
• On square-free vertex colorings of graphs
• Nonrepetitive colorings of graphs

This page was built for publication: Nonrepetitive vertex colorings of graphs