{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:48:14Z","timestamp":1648910894197},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T00:00:00Z","timestamp":1554768000000},"content-version":"tdm","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":[[2019,7]]},"DOI":"10.1007\/s00373-019-02035-0","type":"journal-article","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T08:03:26Z","timestamp":1554797006000},"page":"827-836","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hamiltonian Spectra of Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Li-Da","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao-Yu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"key":"2035_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/jgt.3190040310","volume":"4","author":"T Asano","year":"1980","unstructured":"Asano, T., Nishizeki, T., Watanabe, T.: An upper bound on the length of a hamiltonian walk of a maximai planar graph. J. Graph Thoery 4, 315\u2013336 (1980)","journal-title":"J. Graph Thoery"},{"key":"2035_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0166-218X(83)90042-2","volume":"5","author":"T Asano","year":"1983","unstructured":"Asano, T., Nishizeki, T., Watanabe, T.: An approximation algorithm for the hamiltonian walk problems on maximal planar graphs. Discrete Appl. Math. 5, 211\u2013222 (1983)","journal-title":"Discrete Appl. Math."},{"key":"2035_CR3","first-page":"41","volume":"15","author":"JC Bermond","year":"1976","unstructured":"Bermond, J.C.: On hamiltonian walks. Congr. Numer. 15, 41\u201351 (1976)","journal-title":"Congr. Numer."},{"key":"2035_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory. Discrete Math. 15, 111\u2013135 (1976)","journal-title":"Discrete Math."},{"key":"2035_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. American Elsevier Publishing Co., Inc., New York (1976)"},{"key":"2035_CR6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s10878-010-9360-4","volume":"23","author":"GJ Chang","year":"2012","unstructured":"Chang, G.J., Chang, T.-P., Tong, L.-D.: The hamiltonian numbers of M\u00f6bius double loop networks. J. Comb. Optim. 23, 462\u2013470 (2012)","journal-title":"J. Comb. Optim."},{"key":"2035_CR7","first-page":"56","volume":"165","author":"G Chartrand","year":"2003","unstructured":"Chartrand, G., Saenpholphat, V., Thomas, T., Zhang, P.: On the hamiltonian number of a graph. Congr. Numer. 165, 56\u201364 (2003)","journal-title":"Congr. Numer."},{"key":"2035_CR8","first-page":"37","volume":"42","author":"G Chartrand","year":"2004","unstructured":"Chartrand, G., Saenpholphat, V., Thomas, T., Zhang, P.: A new look at hamiltonian walks. Bull. ICA 42, 37\u201352 (2004)","journal-title":"Bull. ICA"},{"key":"2035_CR9","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/s10878-012-9512-9","volume":"25","author":"TP Chang","year":"2013","unstructured":"Chang, T.P., Tong, L.-D.: The hamiltonian numbers in digraphs. J. Comb. Optim. 25, 694\u2013701 (2013)","journal-title":"J. Comb. Optim."},{"key":"2035_CR10","unstructured":"Goodman, S.E., Hedetniemi, S.T.: On hamiltonian walks in graphs. In: Proc. Fourth Southestern Conf. Combin., Graph Theory and Computing, Utilitas Math., vol. 1973, pp. 335\u2013342 (1973)"},{"key":"2035_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0203017","volume":"3","author":"SE Goodman","year":"1974","unstructured":"Goodman, S.E., Hedetniemi, S.T.: On hamiltonian walks in graphs. SIAM J. Comput. 3, 214\u2013221 (1974)","journal-title":"SIAM J. Comput."},{"key":"2035_CR12","first-page":"329","volume":"35","author":"D Kral","year":"2006","unstructured":"Kral, D., Tong, L.-D., Zhu, X.: Upper hamiltonian number and the hamiltonian spectra of graphs. Aust. J. Combin. 35, 329\u2013340 (2006)","journal-title":"Aust. J. Combin."},{"key":"2035_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-89550-3_23","volume":"4535","author":"S Thaithae","year":"2008","unstructured":"Thaithae, S., Punnim, N.: The Hamiltonian number of cubic graphs. Lect. Notes Comput. Sci. 4535, 213\u2013223 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"key":"2035_CR14","first-page":"237","volume":"90","author":"S Thaithae","year":"2009","unstructured":"Thaithae, S., Punnim, N.: The Hamiltonian number of graphs with prescribed connectivity. ARS Combin. 90, 237\u2013244 (2009)","journal-title":"ARS Combin."},{"key":"2035_CR15","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1007\/s10878-017-0141-1","volume":"34","author":"L-D Tong","year":"2017","unstructured":"Tong, L.-D., Yang, H.-Y.: Hamiltonian numbers in oriented graphs. J. Comb. Optim. 34, 1210\u20131217 (2017)","journal-title":"J. Comb. Optim."},{"key":"2035_CR16","first-page":"105","volume":"27A","author":"P Vacek","year":"1991","unstructured":"Vacek, P.: On open hamiltonian walks in graphs. Arch. Math. 27A, 105\u2013111 (1991)","journal-title":"Arch. Math."},{"key":"2035_CR17","first-page":"11","volume":"28","author":"P Vacek","year":"1992","unstructured":"Vacek, P.: Bounds of lengths of open hamiltonian walks. Arch. Math. 28, 11\u201316 (1992)","journal-title":"Arch. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02035-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02035-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02035-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T23:20:01Z","timestamp":1586301601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02035-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,9]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["2035"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02035-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,9]]},"assertion":[{"value":"2 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}