{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:44:38Z","timestamp":1760820278720},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T00:00:00Z","timestamp":1287014400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10878-010-9360-4","type":"journal-article","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T03:37:06Z","timestamp":1287027426000},"page":"462-470","source":"Crossref","is-referenced-by-count":4,"title":["Hamiltonian numbers of M\u00f6bius double loop networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Pang","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Da","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,14]]},"reference":[{"key":"9360_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/jgt.3190040310","volume":"4","author":"T Asano","year":"1980","unstructured":"Asano T, Nishizeki T, Watanabe T (1980) An upper bound on the length of a Hamiltonian walk of a maxima planar graph. J Graph Theory 4:315\u2013336","journal-title":"J Graph Theory"},{"key":"9360_CR2","doi-asserted-by":"crossref","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 (1983) An approximation algorithm for the Hamiltonian walk problems on maximal planar graphs. Discrete Appl Math 5:211\u2013222","journal-title":"Discrete Appl Math"},{"key":"9360_CR3","first-page":"41","volume":"15","author":"JC Bermond","year":"1976","unstructured":"Bermond JC (1976) On Hamiltonian walks. Congr Numer 15:41\u201351","journal-title":"Congr Numer"},{"key":"9360_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. North-Holland, Amsterdam"},{"key":"9360_CR5","first-page":"56","volume":"165","author":"G Chartrand","year":"2003","unstructured":"Chartrand G, Saenpholphat V, Thomas T, Zhang P (2003) On the Hamiltonian number of a graph. Congr Numer 165:56\u201364","journal-title":"Congr Numer"},{"key":"9360_CR6","first-page":"37","volume":"42","author":"G Chartrand","year":"2004","unstructured":"Chartrand G, Saenpholphat V, Thomas T, Zhang P (2004) A new look at Hamiltonian walks. Bull ICA 42:37\u201352","journal-title":"Bull ICA"},{"key":"9360_CR7","first-page":"335","volume-title":"Proc fourth southestern conf combin graph theory and computing, utilitas math","author":"SE Goodman","year":"1973","unstructured":"Goodman SE, Hedetniemi ST (1973) On Hamiltonian walks in graphs. In: Proc fourth southestern conf combin graph theory and computing, utilitas math, pp 335\u2013342"},{"key":"9360_CR8","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0203017","volume":"3","author":"SE Goodman","year":"1974","unstructured":"Goodman SE, Hedetniemi ST (1974) On Hamiltonian walks in graphs. SIAM J Comput 3:214\u2013221","journal-title":"SIAM J Comput"},{"key":"9360_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0304-3975(00)00243-7","volume":"263","author":"FK Hwang","year":"2001","unstructured":"Hwang FK (2001) A complementary survey on double-loop networks. Theor Comput Sci 263:211\u2013229","journal-title":"Theor Comput Sci"},{"key":"9360_CR10","first-page":"329","volume":"35","author":"D Kral","year":"2006","unstructured":"Kral D, Tong L-D, Zhu X (2006) Upper Hamiltonian number and the Hamiltonian spectra of graphs. Aust J Combin 35:329\u2013340","journal-title":"Aust J Combin"},{"key":"9360_CR11","first-page":"213","volume-title":"Lect Notes Comput Sci","author":"S Thaithae","year":"2008","unstructured":"Thaithae S, Punnim N (2008) The Hamiltonian number of cubic graphs. In: Lect Notes Comput Sci, vol\u00a04535, pp 213\u2013223"},{"key":"9360_CR12","first-page":"237","volume":"90","author":"S Thaithae","year":"2009","unstructured":"Thaithae S, Punnim N (2009) The Hamiltonian number of graphs with prescribed connectivity. Ars Combin 90:237\u2013244","journal-title":"Ars Combin"},{"key":"9360_CR13","first-page":"11","volume":"28","author":"P Vacek","year":"1992","unstructured":"Vacek P (1992) Bounds of lengths of open Hamiltonian walks. Arch Math 28:11\u201316","journal-title":"Arch Math"},{"key":"9360_CR14","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB (1996) Introduction to graph theory. Prentice Hall, New York"},{"key":"9360_CR15","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"CK Wong","year":"1974","unstructured":"Wong CK, Coppersmith D (1974) A combinatorial problem related to multimodule memory organizations. J ACM 21:392\u2013402","journal-title":"J ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9360-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9360-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9360-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:14Z","timestamp":1559262194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9360-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,14]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9360"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9360-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,14]]}}}