Nonrepetitive vertex colorings of graphs

DOI10.1016/J.DISC.2011.09.027zbMATH Open1233.05103OpenAlexW1997528646MaRDI QIDQ658062FDOQ658062

Authors: Jochen Harant, Stanislav 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

Recommendations

• Nonrepetitive colorings of graphs
• Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• Planar graphs have bounded nonrepetitive chromatic number

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)

Cites Work

• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Graphs drawn with few crossings per edge
• The structure of 1-planar graphs
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Facial non-repetitive edge-coloring of plane graphs
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• Nonrepetitive colorings of graphs of bounded tree-width
• Nonrepetitive colorings of trees
• On square-free vertex colorings of graphs

Cited In (23)

• Layered separators in minor-closed graph classes with applications
• Avoiding squares over words with lists of size three amongst four symbols
• New bounds for facial nonrepetitive colouring
• Title not available (Why is that?)
• On the facial Thue choice number of plane graphs via entropy compression method
• Anagram-Free Colorings of Graph Subdivisions
• Planar graphs have bounded nonrepetitive chromatic number
• Nonrepetitive colouring via entropy compression
• Facially-constrained colorings of plane graphs: a survey
• Another approach to non-repetitive colorings of graphs of bounded degree
• On the facial Thue choice index via entropy compression
• A general framework for hypergraph coloring
• Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
• Fractional Thue chromatic number of graphs
• Anagram-free graph colouring
• The local cut lemma
• Nonrepetitive colorings of line arrangements
• Pathwidth and nonrepetitive list coloring
• Facial nonrepetitive vertex coloring of plane graphs
• Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
• Facial anagram-free edge-coloring of plane graphs
• Fractional Thue chromatic numbers of cycles
• A note on the thue chromatic number of lexicographic products of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658062)