{"paper":{"title":"The Thue choice number versus the Thue chromatic number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erika \\v{S}krabu\\v{l}\\'akov\\'a","submitted_at":"2015-08-11T11:18:32Z","abstract_excerpt":"We say that a vertex colouring $\\varphi$ of a graph $G$ is nonrepetitive if there is no positive integer $n$ and a path on $2n$ vertices $v_{1}\\ldots v_{2n}$ in $G$ such that the associated sequence of colours $\\varphi(v_{1})\\ldots\\varphi(v_{2n})$ satisfy $\\varphi(v_{i})=\\varphi(v_{i+n})$ for all $i=1,2,\\dots,n$. The minimum number of colours in a nonrepetitive vertex colouring of $G$ is the Thue chromatic number $\\pi (G)$. For the case of vertex list colourings the Thue choice number $\\pi_{l}(G)$ of $G$ denotes the smallest integer $k$ such that for every list assignment $L:V(G)\\rightarrow 2^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02559","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"}