{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T03:45:27Z","timestamp":1790307927332,"version":"4.1.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We show that every graph can be subdivided in a way that the resulting graph can be colored without repetitions on paths using only 3 colors. This extends the result of Thue asserting the existence of arbitrarily long nonrepetitive strings over a 3-letter alphabet.<\/jats:p>","DOI":"10.37236\/253","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:31:28Z","timestamp":1578699088000},"source":"Crossref","is-referenced-by-count":9,"title":["Non-Repetitive 3-Coloring of Subdivided Graphs"],"prefix":"10.37236","volume":"16","author":[{"given":"Andrzej","family":"Pezarski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Zmarz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2009,5,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1n15\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1n15\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:55:10Z","timestamp":1579298110000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1n15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,20]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/253","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,20]]},"article-number":"N15"}}