Nonrepetitive vertex colorings of graphs

DOI10.1016/j.disc.2011.09.027zbMath1233.05103MaRDI 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 number; facial Thue chromatic number

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Anagram-Free Colorings of Graph Subdivisions, On the facial Thue choice number of plane graphs via entropy compression method, Pathwidth and nonrepetitive list coloring, Nonrepetitive colouring via entropy compression, Fractional Thue chromatic number of graphs, Anagram-free graph colouring, Another approach to non-repetitive colorings of graphs of bounded degree, The local cut lemma, 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, New bounds for facial nonrepetitive colouring, Facial Nonrepetitive Vertex Coloring of Plane Graphs, On the Facial Thue Choice Index via Entropy Compression

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