{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:04:56Z","timestamp":1770966296518,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s00373-025-03000-w","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T20:39:53Z","timestamp":1766435993000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Square-free Word-representation of Word-representable Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Biswajit","family":"Das","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7225-6466","authenticated-orcid":false,"given":"Ramesh","family":"Hariharasubramanian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,22]]},"reference":[{"key":"3000_CR1","unstructured":"Broere, B.: Word-representable graphs. Master thesis at Radboud University, Nijmegen (2018)"},{"key":"3000_CR2","unstructured":"Gao, A.L.L., Kitaev, S., Zhang, P.B.: On 132-representable graphs. Australas. J. Combin. 69, 105\u2013118 (2017). http:\/\/ajc.maths.uq.edu.au\/pdf\/69\/ajc_v69_p105.pdf"},{"key":"3000_CR3","doi-asserted-by":"publisher","unstructured":"Jones, M.E., Kitaev, S., Pyatkin, A.V., Remmel, J.B.: Representing graphs via pattern avoiding words. Electron. J. Comb. 22(2), P2.53 (2015). https:\/\/doi.org\/10.37236\/4946","DOI":"10.37236\/4946"},{"key":"3000_CR4","doi-asserted-by":"crossref","unstructured":"Kitaev, S.: A comprehensive introduction to the theory of word-representable graphs. In: International Conference on Developments in Language Theory, pp. 36\u201367. Springer (2017)","DOI":"10.1007\/978-3-319-62809-7_2"},{"issue":"3","key":"3000_CR5","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/jgt.22097","volume":"85","author":"S Kitaev","year":"2017","unstructured":"Kitaev, S.: Existence of u-representation of graphs. J. Graph Theory 85(3), 661\u2013668 (2017). https:\/\/doi.org\/10.1002\/jgt.22097","journal-title":"J. Graph Theory"},{"key":"3000_CR6","doi-asserted-by":"crossref","unstructured":"Kitaev, S., Lozin, V.: Words and graphs. Springer (2015)","DOI":"10.1007\/978-3-319-25859-1"},{"issue":"1","key":"3000_CR7","first-page":"45","volume":"13","author":"S Kitaev","year":"2008","unstructured":"Kitaev, S., Pyatkin, A.: On representable graphs. J. Autom. Lang. Comb. 13(1), 45\u201354 (2008)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"3000_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11083-008-9083-7","volume":"25","author":"S Kitaev","year":"2008","unstructured":"Kitaev, S., Seif, S.: Word problem of the perkins semigroup via directed acyclic graphs. Order 25(3), 177\u2013194 (2008)","journal-title":"Order"},{"issue":"2","key":"3000_CR9","doi-asserted-by":"publisher","first-page":"375","DOI":"10.7151\/dmgt.2128","volume":"39","author":"Y Mandelshtam","year":"2019","unstructured":"Mandelshtam, Y.: On graphs presentable by pattern-avoiding words. Discuss. Math. Graph Theory 39(2), 375\u2013389 (2019). https:\/\/doi.org\/10.7151\/dmgt.2128","journal-title":"Discuss. Math. Graph Theory"},{"key":"3000_CR10","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A second Course in Formal Languages And Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511808876"},{"key":"3000_CR11","unstructured":"Thue, A.: Uber unendliche zeichenreihen. Norske Vid Selsk. Skr. I Mat-Nat Kl.(Christiana) 7, 1\u201322 (1906)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03000-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-03000-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03000-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:04:53Z","timestamp":1770962693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-03000-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,22]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["3000"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-03000-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,22]]},"assertion":[{"value":"12 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"12"}}