{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:10:16Z","timestamp":1776867016768,"version":"3.51.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T00:00:00Z","timestamp":1448841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["CNSF11171310"],"award-info":[{"award-number":["CNSF11171310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00373-015-1652-0","type":"journal-article","created":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T14:47:38Z","timestamp":1448894858000},"page":"1635-1640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["$$(2+\\epsilon )$$ ( 2 + \u03f5 ) -Nonrepetitive List Colouring of Paths"],"prefix":"10.1007","volume":"32","author":[{"given":"Huanhua","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,30]]},"reference":[{"key":"1652_CR1","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.tcs.2004.12.024","volume":"332","author":"A Aberkane","year":"2005","unstructured":"Aberkane, A., Currie, J.D.: The Thue-Morse word contains circular $$(5\/2)^+$$ ( 5 \/ 2 ) + -power-free words of every length. Theory Comput. Sci. 332, 573\u2013581 (2005)","journal-title":"Theory Comput. Sci."},{"issue":"4","key":"1652_CR2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.36045\/bbms\/1133793340","volume":"12","author":"A Aberkane","year":"2005","unstructured":"Aberkane, A., Currie, J.D.: Attainable lengths for circular binary words avoiding $$k$$ k -powers. Bull. Belg. Math. Soc. Simon Stevin 12(4), 525\u2013534 (2005)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"1652_CR3","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1002\/rsa.10057","volume":"21","author":"N Alon","year":"2002","unstructured":"Alon, N., Grytczuk, J., Ha\u0142uszczak, M., Riordan, O.: Nonrepetitive colourings of graphs. Random Struct. Algorithm 21, 336\u2013346 (2002). 7 (1906), 1-22","journal-title":"Random Struct. Algorithm"},{"key":"1652_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.tcs.2007.06.001","volume":"385","author":"A Carpi","year":"2007","unstructured":"Carpi, A.: On Dejean\u2019s conjecture over large alphabets. Theory Comput. Sci. 385, 137\u2013151 (2007)","journal-title":"Theory Comput. Sci."},{"key":"1652_CR5","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"JD Currie","year":"2011","unstructured":"Currie, J.D., Rampersad, N.: A proof of Dejean\u2019s conjecture. Math. Comput. 80, 1063\u20131070 (2011)","journal-title":"Math. Comput."},{"key":"1652_CR6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e9me de Thue. J. Comb. Theory Ser. A 13, 90\u201399 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"key":"1652_CR7","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1016\/j.ejc.2013.02.007","volume":"34","author":"L Esperet","year":"2013","unstructured":"Esperet, L., Parreau, A.: Acyclic edge-coloring using entropy compression. Eur. J. Comb. 34, 1019\u20131027 (2013)","journal-title":"Eur. J. Comb."},{"key":"1652_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics. Cambridge University Press, Cambridge (2009)"},{"issue":"17","key":"1652_CR9","doi-asserted-by":"crossref","first-page":"2045","DOI":"10.1016\/j.dam.2011.07.017","volume":"159","author":"F Fiorenzi","year":"2011","unstructured":"Fiorenzi, F., Ochem, P., Ossona de Mendez, P., Zhu, X.: Thue choosability of trees. Discret. Appl. Math 159(17), 2045\u20132049 (2011)","journal-title":"Discret. Appl. Math"},{"key":"1652_CR10","doi-asserted-by":"crossref","unstructured":"I.A. Gorbunova, Repetition threshold for circular words, Electron. J. Comb. 19(4) (2012) #P11","DOI":"10.37236\/2365"},{"key":"1652_CR11","doi-asserted-by":"publisher","unstructured":"Grytczuk, J.: Nonrepetitive colourings of graphs A survey. Int. J. Math. Math. Sci. Vol. Article ID 74639, 10 pages (2007). doi: 10.1155\/2007\/74639","DOI":"10.1155\/2007\/74639"},{"key":"1652_CR12","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1002\/rsa.20347","volume":"38","author":"J Grytczuk","year":"2011","unstructured":"Grytczuk, J., Przyby\u0142o, J., Zhu, X.: Nonrepetitive list colorings of paths. Random Struct. Algorithms 38, 162\u2013173 (2011)","journal-title":"Random Struct. Algorithms"},{"key":"1652_CR13","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1137\/120866361","volume":"27","author":"J Kozik","year":"2013","unstructured":"Kozik, J., Micek, P.: Nonrepetitive choice number of trees. SIAM J. Discret. Math. 27, 436\u2013446 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"1652_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(92)90264-G","volume":"95","author":"JM Ollagnier","year":"1992","unstructured":"Ollagnier, J.M.: Proof of Dejean\u2019s conjecture for alphabets with $$5, 6, 7, 8, 9, 10$$ 5 , 6 , 7 , 8 , 9 , 10 and $$11$$ 11 letters. Theory Comput. Sci. 95, 187\u2013205 (1992)","journal-title":"Theory Comput. Sci."},{"issue":"27","key":"1652_CR15","doi-asserted-by":"crossref","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theory Comput. Sci. 412(27), 3010\u20133018 (2011)","journal-title":"Theory Comput. Sci."},{"issue":"7","key":"1652_CR16","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1142\/S0129054111008969","volume":"22","author":"AM Shur","year":"2011","unstructured":"Shur, A.M.: On the existence of minimal $$\\beta $$ \u03b2 -powers. Int. J. Found. Comput. Sci. 22(7), 1683\u20131696 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1652_CR17","volume-title":"Substitution dynamical systems-spectral analysis, lecture notes in mathmatics 1294","author":"M Queff\u00e9lec","year":"1987","unstructured":"Queff\u00e9lec, M.: Substitution dynamical systems-spectral analysis, lecture notes in mathmatics 1294. Spring-Verlag, Berlin (1987)"},{"key":"1652_CR18","first-page":"1","volume":"7","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen, Norske Videnskabers Selskabs Skrifter, I Mathmatic-Naturwissenschaftliche Klasse. Christiania 7, 1\u201322 (1906)","journal-title":"Christiania"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1652-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1652-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1652-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T02:07:43Z","timestamp":1599876463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1652-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,30]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1652"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1652-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,30]]}}}