{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:02:27Z","timestamp":1755799347678,"version":"3.44.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/icawst.2017.8256461","type":"proceedings-article","created":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T18:14:15Z","timestamp":1516212855000},"page":"27-34","source":"Crossref","is-referenced-by-count":0,"title":["The Hamiltonian connectivity of some alphabet supergrid graphs"],"prefix":"10.1109","author":[{"given":"Ruo-Wei","family":"Hung","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, Chaoyang University of Technology, Wufeng, Taichung, Taiwan"}]},{"given":"Jun-Lin","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, Chaoyang University of Technology, Wufeng, Taichung, Taiwan"}]},{"given":"Chih-Han","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, Chaoyang University of Technology, Wufeng, Taichung, Taiwan"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1007\/978-1-4612-1098-6"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1016\/j.ipl.2004.03.009"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1016\/S0167-5060(04)80051-7","article-title":"Algorithmic Graph Theory and Perfect Graphs","author":"golumbic","year":"2004","journal-title":"Second edition Annals of Discrete Mathematics 57"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/j.disc.2007.11.040"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1016\/S0166-218X(98)00070-5"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/j.camwa.2006.10.033"},{"key":"ref14","first-page":"42","article-title":"Constructing two edge-disjoint Hamiltonian cycles and two-equal path cover in augmented cubes","volume":"39","author":"hung","year":"2012","journal-title":"IAENG Int J Comput Science"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.tcs.2015.08.024"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.dam.2016.04.020"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1016\/j.disopt.2017.06.001"},{"key":"ref18","first-page":"432","article-title":"The Hamiltonicity and Hamiltonian connectivity of some shaped supergrid graphs","volume":"44","author":"hung","year":"2017","journal-title":"IAENG Int J Comput Science"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.compeleceng.2007.05.011"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/371209.371541"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<56::AID-NET5>3.0.CO;2-D"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/NCIS.2011.120"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/978-1-349-03521-2"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/0020-0190(89)90059-8"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/S0146-664X(74)80004-3"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/S0096-3003(02)00933-5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/j.ins.2008.02.011"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.7873\/DATE.2013.325"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/0020-0190(86)90135-3"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref9"},{"key":"ref1","article-title":"Hamiltonian Path Problems in the online Optimization of Flexible Manufacturing Systems","author":"ascheuer","year":"1996","journal-title":"Technique Report TR 96&#x2013;3 Konrad-Zuse-Zentrum f&#x00FC;r Informationstechnik Berlin"},{"key":"ref20","first-page":"97","article-title":"Fault-tolerant ring embedding in faulty crossed cubes","author":"huang","year":"2000","journal-title":"Proceedings of World Multicon-ference on Systemics Cybernetics and Informatics (SCI'2000)"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1137\/0211056"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1006\/jpdc.2001.1813"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1002\/net.3230230414"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1016\/0196-6774(85)90012-4"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/CIT.2009.17"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/990518.990521"}],"event":{"name":"2017 8th International Conference on Awareness Science and Technology (iCAST)","start":{"date-parts":[[2017,11,8]]},"location":"Taichung, Taiwan","end":{"date-parts":[[2017,11,10]]}},"container-title":["2017 IEEE 8th International Conference on Awareness Science and Technology (iCAST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8241554\/8256413\/08256461.pdf?arnumber=8256461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T18:08:29Z","timestamp":1755626909000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8256461\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/icawst.2017.8256461","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}