{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:32:59Z","timestamp":1763663579817,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T00:00:00Z","timestamp":1496620800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ontario Ministry of Economic Development and Innovation (CA)"},{"name":"Natural Sciences and Engineering Research Council of Canada (CA)"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","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":[[2017,7]]},"DOI":"10.1007\/s00373-017-1816-1","type":"journal-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T15:58:26Z","timestamp":1496678306000},"page":"817-832","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New Bounds for Facial Nonrepetitive Colouring"],"prefix":"10.1007","volume":"33","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]},{"given":"Lucas","family":"Rioux-Maldague","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,5]]},"reference":[{"key":"1816_CR1","doi-asserted-by":"crossref","unstructured":"Allouche J.-P., Shallit J.: The ubiquitous Prouhet\u2013Thue\u2013Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and their Applications Proceedings of SETA \u201898 , pp. 1\u201316. Springer, Berlin (1999). http:\/\/www.springer.com\/la\/book\/9781852331962","DOI":"10.1007\/978-1-4471-0551-0_1"},{"issue":"3\u20134","key":"1816_CR2","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 colorings of graphs. Random Struct. Algorithms 21(3\u20134), 336\u2013346 (2002)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"1816_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/jgt.21695","volume":"74","author":"J Bar\u00e1t","year":"2013","unstructured":"Bar\u00e1t, J., Czap, J.: Facial nonrepetitive vertex coloring of plane graphs. J. Gr. Theory 74(1), 115\u2013121 (2013)","journal-title":"J. Gr. Theory"},{"issue":"3","key":"1816_CR4","first-page":"411","volume":"44","author":"J Bar\u00e1t","year":"2007","unstructured":"Bar\u00e1t, J., Varj\u00fa, P.P.: On square-free vertex colorings of graphs. Stud. Sci. Math. Hung. 44(3), 411\u2013422 (2007)","journal-title":"Stud. Sci. Math. Hung."},{"key":"1816_CR5","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Wood D.R.: Notes on nonrepetitive graph colouring. Electron. J. Comb. 15(1)\u201399 (2008) (Research Paper) (13)","DOI":"10.37236\/823"},{"key":"1816_CR6","volume-title":"Graph Theory. Graduate Texts in Mathematics","author":"J-A Bondy","year":"2007","unstructured":"Bondy, J.-A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer, New York (2007)"},{"issue":"2","key":"1816_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.disc.2006.06.017","volume":"307","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar, B., Grytczuk, J., Klav\u017ear, S., Niwczyk, S., Peterin, I.: Nonrepetitive colorings of trees. Discret. Math. 307(2), 163\u2013172 (2007)","journal-title":"Discret. Math."},{"issue":"1","key":"1816_CR8","doi-asserted-by":"crossref","first-page":"N10","DOI":"10.37236\/1671","volume":"9","author":"JD Currie","year":"2002","unstructured":"Currie, J.D.: There are ternary circular square-free words of length n for $$n\\ge 18$$ n \u2265 18 . Electron. J. Comb. 9(1), N10 (2002)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"1816_CR9","doi-asserted-by":"crossref","first-page":"P51","DOI":"10.37236\/3153","volume":"20","author":"V Dujmovi\u0107","year":"2013","unstructured":"Dujmovi\u0107, V., Frati, F., Joret, G., Wood, D.R.: Nonrepetitive colourings of planar graphs with $$O(\\log n)$$ O ( log n ) colours. Electron. J. Comb. 20(1), P51 (2013)","journal-title":"Electron. J. Comb."},{"key":"1816_CR10","unstructured":"Dujmovi\u0107, V., Joret, G., Kozik, J., Wood, D.R.: Nonrepetitive colouring via entropy compression. Combinatorica (2013) (in press)"},{"issue":"17","key":"1816_CR11","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., de Mendez, P.O., Zhu, X.: Thue choosability of trees. Discret. Appl. Math. 159(17), 2045\u20132049 (2011)","journal-title":"Discret. Appl. Math."},{"key":"1816_CR12","unstructured":"Gagol, A., Joret, G., Kozik, J., Micek, P.: Pathwidth and nonrepetitive list coloring (2016). arXiv:1601.01886"},{"key":"1816_CR13","unstructured":"Gon\u00e7alves, D., Montassier, M., Pinlou, A.: Entropy compression method applied to graph colorings. In: 9th international colloquium on graph theory and combinatorics (2014)"},{"key":"1816_CR14","doi-asserted-by":"crossref","unstructured":"Grytczuk, J.: Nonrepetitive colorings of graphs\u2014a survey. Int. J. Math. Math. Sci. 2007 (2007) (Article 74639)","DOI":"10.1155\/2007\/74639"},{"key":"1816_CR15","doi-asserted-by":"crossref","unstructured":"Grytczuk J.: Nonrepetitive graph coloring. In: Bondy, A., Fonlupt, J., Fouquet, J.-L., Fournier, J.-C., Ram\u00edrez Alfons\u00edn, J.L. (eds.) Graph Theory in Paris Proceedings of a Conference in Memory of Claude Berge, pp. 209\u2013218. Springer, Berlin (2007). http:\/\/www.springer.com\/us\/book\/9783764372286","DOI":"10.1007\/978-3-7643-7400-6_16"},{"issue":"2","key":"1816_CR16","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1002\/rsa.20411","volume":"42","author":"J Grytczuk","year":"2013","unstructured":"Grytczuk, J., Kozik, J., Micek, P.: New approach to nonrepetitive sequences. Random Struct. Algorithms 42(2), 214\u2013225 (2013)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"1816_CR17","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.disc.2011.09.027","volume":"312","author":"J Harant","year":"2012","unstructured":"Harant, J., Jendrol, S.: Nonrepetitive vertex colorings of graphs. Discret. Math. 312(2), 374\u2013380 (2012)","journal-title":"Discret. Math."},{"issue":"1","key":"1816_CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1002\/jgt.20488","volume":"66","author":"F Havet","year":"2011","unstructured":"Havet, F., Jendrol, S., Sot\u00e1k, R., \u0160krabul\u2019\u00e1kov\u00e1, E.: Facial non-repetitive edge-coloring of plane graphs. J. Gr. Theory 66(1), 38\u201348 (2011)","journal-title":"J. Gr. Theory"},{"issue":"1","key":"1816_CR19","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(1), 436\u2013446 (2013)","journal-title":"SIAM J. Discret. Math."},{"issue":"19","key":"1816_CR20","doi-asserted-by":"crossref","first-page":"4473","DOI":"10.1016\/j.disc.2007.08.043","volume":"308","author":"A K\u00fcndgen","year":"2008","unstructured":"K\u00fcndgen, A., Pelsmajer, M.J.: Nonrepetitive colorings of graphs of bounded tree-width. Discret. Math. 308(19), 4473\u20134478 (2008)","journal-title":"Discret. Math."},{"issue":"1","key":"1816_CR21","doi-asserted-by":"crossref","first-page":"N15","DOI":"10.37236\/253","volume":"16","author":"A Pezarski","year":"2009","unstructured":"Pezarski, A., Zmarz, M.: Non-repetitive 3-coloring of subdivided graphs. Electron. J. Comb. 16(1), N15 (2009)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"1816_CR22","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/jgt.21781","volume":"77","author":"J Przyby\u0142o","year":"2014","unstructured":"Przyby\u0142o, J.: On the facial Thue choice index via entropy compression. J. Gr. Theory 77(3), 180\u2013189 (2014)","journal-title":"J. Gr. Theory"},{"key":"1816_CR23","doi-asserted-by":"crossref","unstructured":"Schreyer, J., \u0160krabul\u2019\u00e1kov\u00e1, E.: On the facial Thue choice index of plane graphs. Discret. Math. 312(10), 1713\u20131721 (2012)","DOI":"10.1016\/j.disc.2012.01.023"},{"issue":"1","key":"1816_CR24","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/s40879-014-0016-2","volume":"1","author":"J Schreyer","year":"2015","unstructured":"Schreyer, J., \u0160krabul\u2019\u00e1kov\u00e1, E.: Total Thue colourings of graphs. Eur. J. Math. 1(1), 186\u2013197 (2015)","journal-title":"Eur. J. Math."},{"key":"1816_CR25","unstructured":"Thue, A.: \u00dcber unendliche zeichenreichen. Norske Vid Selsk. Skr. I. Mat. Nat. Kl. Christiana 7, 1\u201322 (1906)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1816-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1816-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1816-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T13:37:58Z","timestamp":1602250678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1816-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,5]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1816"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1816-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,6,5]]}}}