{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:36Z","timestamp":1759063716914},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T00:00:00Z","timestamp":1484092800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00373-017-1762-y","type":"journal-article","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T14:53:27Z","timestamp":1484146407000},"page":"369-385","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle"],"prefix":"10.1007","volume":"33","author":[{"given":"Ronald J.","family":"Gould","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colton","family":"Magnant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pouria","family":"Salehi Nowbandegani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"1762_CR1","volume-title":"Graphs & Digraphs","author":"G Chartrand","year":"2011","unstructured":"Chartrand, G., Lesniak, L., Zhang, P.: Graphs & Digraphs, 5th edn. CRC Press, Boca Raton (2011)","edition":"5"},{"key":"1762_CR2","unstructured":"Coll, V., Halperin, A., Magnant, C.: Graph linkage with prescribed lengths (submitted)"},{"key":"1762_CR3","unstructured":"Coll, V., Halperin, A., Magnant, C., Salehi\u00a0Nowbandegani, P.: Enomoto and Ota\u2019s conjecture holds for large graphs (manuscript)"},{"key":"1762_CR4","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory. In: Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"1762_CR5","unstructured":"Enomoto, H.: Personal communication"},{"issue":"23","key":"1762_CR6","doi-asserted-by":"crossref","first-page":"2772","DOI":"10.1016\/j.disc.2013.08.012","volume":"313","author":"RJ Faudree","year":"2013","unstructured":"Faudree, R.J., Gould, R.J.: Precise location of vertices on Hamiltonian cycles. Discrete Math. 313(23), 2772\u20132777 (2013)","journal-title":"Discrete Math."},{"issue":"1","key":"1762_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1002\/jgt.20564","volume":"69","author":"RJ Faudree","year":"2012","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S., Magnant, C.: Distributing vertices on Hamiltonian cycles. J. Graph Theory 69(1), 28\u201345 (2012)","journal-title":"J. Graph Theory"},{"issue":"4","key":"1762_CR8","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1007\/s00373-013-1325-9","volume":"30","author":"RJ Faudree","year":"2014","unstructured":"Faudree, R.J., Lehel, J., Yoshimoto, K.: Note on locating pairs of vertices on Hamiltonian cycles. Graphs Combin. 30(4), 887\u2013894 (2014)","journal-title":"Graphs Combin."},{"issue":"17","key":"1762_CR9","doi-asserted-by":"crossref","first-page":"2700","DOI":"10.1016\/j.disc.2012.02.006","volume":"312","author":"RJ Faudree","year":"2012","unstructured":"Faudree, R.J., Li, H.: Locating pairs of vertices on Hamiltonian cycles. Discrete Math. 312(17), 2700\u20132706 (2012)","journal-title":"Discrete Math."},{"issue":"1","key":"1762_CR10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jctb.2000.1999","volume":"81","author":"A Kaneko","year":"2001","unstructured":"Kaneko, A., Yoshimoto, K.: On a Hamiltonian cycle in which specified vertices are uniformly distributed. J. Combin. Theory Ser. B 81(1), 100\u2013109 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1762_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J Koml\u00f3s","year":"1997","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Blow-up lemma. Combinatorica 17(1), 109\u2013123 (1997)","journal-title":"Combinatorica"},{"issue":"3","key":"1762_CR12","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1137\/080731256","volume":"23","author":"D K\u00fchn","year":"2009","unstructured":"K\u00fchn, D., Osthus, D., Treglown, A.: An Ore-type theorem for perfect packings in graphs. SIAM J. Discrete Math. 23(3), 1335\u20131355 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"1762_CR13","unstructured":"Magnant, C., Salehi\u00a0Nowbandegani, P.: Note on lengths of cycles containing a specified edge (manuscript)"},{"key":"1762_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"issue":"23","key":"1762_CR15","doi-asserted-by":"crossref","first-page":"5757","DOI":"10.1016\/j.disc.2007.10.042","volume":"308","author":"GN S\u00e1rk\u00f6zy","year":"2008","unstructured":"S\u00e1rk\u00f6zy, G.N., Selkow, S.: Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discrete Math. 308(23), 5757\u20135770 (2008)","journal-title":"Discrete Math."},{"key":"1762_CR16","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloquium International CNRS, University of Orsay, Orsay, 1976), vol. 260. Colloquium International, CNRS, pp. 399\u2013401. CNRS, Paris (1978)"},{"issue":"2","key":"1762_CR17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02018497","volume":"8","author":"JE Williamson","year":"1977","unstructured":"Williamson, J.E.: Panconnected graphs. II. Period. Math. Hung. 8(2), 105\u2013116 (1977)","journal-title":"Period. Math. Hung."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1762-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1762-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1762-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:57:23Z","timestamp":1498377443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1762-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,11]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1762"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1762-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,11]]}}}