Anagram-free colourings of graph subdivisions

An anagram is a word of the form \(WP\) where \(W\) is a non-empty word and \(P\) is a permutation of \(W\). A vertex colouring of a graph is anagram-free if no subpath of the graph is an anagram. Anagram-free graph colouring was independently introduced by Kamčev, Łuczak and Sudakov and ourselves....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2017-08
Hauptverfasser:	Wilson, Tim E, Wood, David R
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph coloring Graph theory Lower bounds Permutations Subdivisions Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!