{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:53Z","timestamp":1760245073148,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648246"},{"type":"electronic","value":"9783540685357"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68535-9_31","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:31:22Z","timestamp":1193473882000},"page":"269-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter"],"prefix":"10.1007","author":[{"given":"Jeng-Jung","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Yi","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Men-Yang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,4]]},"reference":[{"key":"31_CR1","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1980","unstructured":"J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, New York, (1980)."},{"key":"31_CR2","first-page":"298","volume":"60","author":"F.R.K. Chung","year":"1987","unstructured":"F.R.K. Chung, Diameters of graphs: Old problems and new results, Proc. 18th South-Eastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 60(1987), 298\u2013319.","journal-title":"Proc. 18th South-Eastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.3230230207","volume":"23","author":"F. Harary","year":"1993","unstructured":"F. Harary and J.P. Hayes, Edge fault tolerance in graphs, Networks, 23(1993), 135\u2013142.","journal-title":"Networks"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/(SICI)1097-0037(199601)27:1<19::AID-NET2>3.0.CO;2-H","volume":"27","author":"F. Harary","year":"1996","unstructured":"F. Harary and J.P. Hayes, Node fault tolerance in graphs, Networks, 27(1996), 19\u201323.","journal-title":"Networks"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01788108","volume":"2","author":"P. Hor\u00e1k","year":"1986","unstructured":"P. Hor\u00e1k and J. \u0160ir\u00e1\u0148, On a construction of Thomassen, Graphs and Combinatorics, 2(1986), 347\u2013350.","journal-title":"Graphs and Combinatorics"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(92)90192-X","volume":"44","author":"K. Mukhopadhyaya","year":"1992","unstructured":"K. Mukhopadhyaya and B.P. Sinha, Hamiltonian graphs with minimum number of edges for fault-tolerant topologies, Information Processing Letters, 44(1992), 95\u201399.","journal-title":"Information Processing Letters"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01858469","volume":"12","author":"L. Stacho","year":"1996","unstructured":"L. Stacho, Maximally non-hamiltonian graphs of girth 7, Graphs and Combinatorics, 12(1996), 361\u2013371.","journal-title":"Graphs and Combinatorics"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0012-365X(74)90074-0","volume":"9","author":"C. Thomassen","year":"1974","unstructured":"C. Thomassen, Hypohamiltonian and hypotraceable graphs, Discrete Math., 9(1974), 91\u201396.","journal-title":"Discrete Math."},{"key":"31_CR9","unstructured":"J.J. Wang, C.N. Hung, and L.H. Hsu, Optimal 1-hamiltonian graphs, accepted by Information Processing Letters."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68535-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T09:55:33Z","timestamp":1589882133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68535-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648246","9783540685357"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-68535-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"4 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}