{"paper":{"title":"On New Thue Colouring Concepts of Certain Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erika Skrabulakova, Johan Kok, Naduvath Sudev","submitted_at":"2016-01-04T07:05:04Z","abstract_excerpt":"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, $\\pi(G)$, as edges are iteratively removed from a graph $G$ is studied. The notion of the $\\tau$-index denoted, $\\tau(G)$, of a graph $G$ is introduced as well. $\\tau(G)$ serves as a measure for the efficiency of edge deletion to reduce the Thue chromatic number of a graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02914","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}