{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:58:57Z","timestamp":1743105537378},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,24]],"date-time":"2012-11-24T00:00:00Z","timestamp":1353715200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00373-012-1261-0","type":"journal-article","created":{"date-parts":[[2012,11,23]],"date-time":"2012-11-23T11:24:57Z","timestamp":1353669897000},"page":"159-170","source":"Crossref","is-referenced-by-count":2,"title":["A Note on Counting Homomorphisms of Paths"],"prefix":"10.1007","volume":"30","author":[{"given":"Roger B.","family":"Eggleton","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Morayne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,24]]},"reference":[{"key":"1261_CR1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.disc.2007.12.049","volume":"309","author":"Sr. Arworn","year":"2009","unstructured":"Arworn, Sr.: An algorithm for the numbers of endomorphisms on paths. Discrete Math. 309 (2009), 94\u2013103","journal-title":"Discrete Math."},{"key":"1261_CR2","doi-asserted-by":"crossref","first-page":"5569","DOI":"10.1016\/j.disc.2008.04.010","volume":"309","author":"Sr. Arworn.","year":"2009","unstructured":"Arworn, Sr., Wojtylak, P.: An algorithm for the number of path homomorphisms. Discrete Math. 309 (2009), 5569\u20135573","journal-title":"Discrete Math."},{"key":"1261_CR3","unstructured":"Lin, Z.C., Zeng, J.: On the number of congruence classes of paths. arXiv reprint 1112.4026v1 [math.CO]. 17 Dec 2011"},{"key":"1261_CR4","unstructured":"Myers, J.: OEIS sequence A102699, editorial note, 23 Dec 2008"},{"key":"1261_CR5","doi-asserted-by":"crossref","unstructured":"Sato M., Cong T.T.: The number of minimal lattice paths restricted by two parallel lines. Discrete Math. 43, 249\u201326 (1983)","DOI":"10.1016\/0012-365X(83)90162-0"},{"key":"1261_CR6","unstructured":"The on-line encyclopedia of integer sequences. The OEIS Foundation. http:\/\/oeis.org\/"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1261-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1261-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1261-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T19:13:59Z","timestamp":1551208439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1261-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,24]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1261"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1261-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,24]]}}}