{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:29:08Z","timestamp":1778660948023,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,6,7]],"date-time":"2013-06-07T00:00:00Z","timestamp":1370563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00373-013-1325-9","type":"journal-article","created":{"date-parts":[[2013,6,6]],"date-time":"2013-06-06T07:01:22Z","timestamp":1370502082000},"page":"887-894","source":"Crossref","is-referenced-by-count":7,"title":["Note on Locating Pairs of Vertices on Hamiltonian Cycles"],"prefix":"10.1007","volume":"30","author":[{"given":"Ralph J.","family":"Faudree","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeno","family":"Lehel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoshi","family":"Yoshimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,7]]},"reference":[{"key":"1325_CR1","volume-title":"Graphs and Digraphs","author":"G. Chartrand","year":"2005","unstructured":"Chartrand G., Lesniak L.: Graphs and Digraphs. Chapman and Hall, London (2005)"},{"key":"1325_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"Dirac G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"1325_CR3","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1002\/jgt.20564","volume":"69","author":"R. Faudree","year":"2012","unstructured":"Faudree R., Gould R., Jacobson M., Magnant C.: Distributing vertices on Hamiltonian cycles. J. Graph Theory 69, 28\u201345 (2012)","journal-title":"J. Graph Theory"},{"key":"1325_CR4","unstructured":"Faudree, R., Li, H.: Locating pairs of vertices on a Hamiltonian cycle. Discrete Math. 312, 2707\u20132719 (2013)"},{"key":"1325_CR5","doi-asserted-by":"crossref","first-page":"309","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, 309\u2013324 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1325_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"J. Moon","year":"1963","unstructured":"Moon J., Moser L.: On hamiltonian bipartite graphs. Israel J. Math. 1, 163\u2013165 (1963)","journal-title":"Israel J. Math."},{"key":"1325_CR7","unstructured":"St, C., Nash-Williams, J.A.: Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency, in Studies in Pure Mathematics, pp. 157\u2013183. Academic Press, London (1971)"},{"key":"1325_CR8","doi-asserted-by":"crossref","first-page":"5757","DOI":"10.1016\/j.disc.2007.10.042","volume":"308","author":"G. S\u00e1rk\u00f6zy","year":"2008","unstructured":"S\u00e1rk\u00f6zy G., Selkow S.: Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discrete Math. 308, 5757\u20135770 (2008)","journal-title":"Discrete Math."},{"key":"1325_CR9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54, 150\u2013168 (1932)","journal-title":"Am. J. Math."},{"key":"1325_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02018497","volume":"8","author":"J. Williamson","year":"1977","unstructured":"Williamson J.: Panconnected graphs. II. Period. Math. Hungar. 8, 105\u2013116 (1977)","journal-title":"Math. Hungar."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1325-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1325-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1325-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:36Z","timestamp":1559055576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1325-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,7]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["1325"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1325-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,7]]}}}