2016/01/04 by Johan Kok, Kok, Johan, Erika Škrabuľáková +3
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1601.02914
openalex publication_date 2016/01/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Thue colouring of a graph is a colouring such that the sequence of vertex colours of any path of even and finite length in G is non-repetitive. The change in the Thue number, π(G), as edges are iteratively removed from a graph G is studied. The notion of the τ-index denoted, τ(G), of a graph G is introduced as well. τ(G) serves as a measure for the efficiency of edge deletion to reduce the Thue chromatic number of a graph.