{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:16Z","timestamp":1725564976919},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_44","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:01:28Z","timestamp":1283713288000},"page":"412-421","source":"Crossref","is-referenced-by-count":3,"title":["Fault Hamiltonicity of Meshes with Two Wraparound Edges"],"prefix":"10.1007","author":[{"given":"Kyoung-Wook","family":"Park","sequence":"first","affiliation":[]},{"given":"Hyeong-Seok","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Jung-Heum","family":"Park","sequence":"additional","affiliation":[]},{"given":"Hee-Chul","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Tsai, C.-H., Tan, J.M., Chuang, Y.C., Hsu, L.-H.: Fault-free cycles and links in faulty recursive circulant graphs. Proceedings of the 2000 International Computer Symposium: Workshop on Computer Algorithms and Theory of Computation, 74\u201377 (2000)"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-45071-8_33","volume-title":"Computing and Combinatorics","author":"J.-H. Park","year":"2003","unstructured":"Park, J.-H., Kim, H.-C.: Fault hamiltonicity of product graph of path and cycle. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 319\u2013328. Springer, Heidelberg (2003)"},{"key":"44_CR3","first-page":"103","volume":"21","author":"G. Simmons","year":"1978","unstructured":"Simmons, G.: Almost all n-dimensional rectangular lattices are Hamilton laceable. Congressus Numerantium\u00a021, 103\u2013108 (1978)","journal-title":"Congressus Numerantium"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-G","volume":"36","author":"S.Y. Hsieh","year":"2000","unstructured":"Hsieh, S.Y., Chen, G.H., Ho, C.W.: Hamiltonian-laceability of star graphs. Networks\u00a036, 225\u2013232 (2000)","journal-title":"Networks"},{"issue":"4","key":"44_CR5","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A. Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Czwarcfiter, J.L.: Hamiltonian paths in grid graphs. SIAM Journal of Computing\u00a011(4), 676\u2013686 (1982)","journal-title":"SIAM Journal of Computing"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/S0167-8191(02)00135-7","volume":"28","author":"S.D. Chen","year":"2002","unstructured":"Chen, S.D., Shen, H., Topor, R.W.: An efficient algorithm for constructing hamiltonian paths in meshes. Parallel Computing\u00a028, 1293\u20131305 (2002)","journal-title":"Parallel Computing"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/S1383-7621(96)00120-8","volume":"43","author":"J.S. Kim","year":"1997","unstructured":"Kim, J.S., Maeng, S.R., Yoon, H.: Embedding of rings in 2-D meshes and tori with faulty nodes. Journal of Systems Architecture\u00a043, 643\u2013654 (1997)","journal-title":"Journal of Systems Architecture"},{"issue":"11","key":"44_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0898-1221(97)00223-X","volume":"34","author":"M. Lewinter","year":"1997","unstructured":"Lewinter, M., Widulski, W.: Hyper-hamilton laceable and caterpillar-spannable product graphs. Computer Math. Applic.\u00a034(11), 99\u2013104 (1997)","journal-title":"Computer Math. Applic."},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0190(02)00214-4","volume":"83","author":"C.-H. Tsai","year":"2002","unstructured":"Tsai, C.-H., Tan, J.M., Lian, T., Hsu, L.-H.: Fault-tolerant hamiltonian laceability of hypercubes. Information Processing Letters\u00a083, 301\u2013306 (2002)","journal-title":"Information Processing Letters"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Chen, C.C., Quimpo, N.F.: On strongly Hamiltonian abelian group graphs. In: Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol.\u00a0884, pp. 23\u201334 (1980)","DOI":"10.1007\/BFb0091805"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Latifi, S., Zheng, S., Bagherzadeh, N.: Optimal ring embedding in hypercubes with faulty links. In: International Symposium on Fault-Tolerant Computing (FTCS), pp. 178\u2013184 (1992)","DOI":"10.1109\/FTCS.1992.243602"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:26:40Z","timestamp":1619998000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}