{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:40:00Z","timestamp":1729654800814,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/icsmc.2009.5345996","type":"proceedings-article","created":{"date-parts":[[2009,12,10]],"date-time":"2009-12-10T14:44:31Z","timestamp":1260456271000},"page":"225-227","source":"Crossref","is-referenced-by-count":0,"title":["One sufficient condition and its applications for Hamiltonian graph using its spanning subgraph"],"prefix":"10.1109","author":[{"given":"Melody Z. W.","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X Q","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S X","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W F","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Introduction to Graph Theory","year":"2006","author":"chartrand","key":"13"},{"year":"0","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00279-5"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00386-1"},{"key":"3","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.tcs.2005.04.009","article-title":"Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs","volume":"341","author":"ruo","year":"2005","journal-title":"Theoretical Computer Science"},{"key":"2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.orl.2005.04.013","article-title":"et a1. Exact algorithms for the Hamiltonian cycle problem in planar graphs","volume":"34","author":"vladimir","year":"2006","journal-title":"Operations Research Letters"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00116-2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00358-2"},{"key":"7","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.endm.2005.06.085","article-title":"Hamiltonian cycles and paths through matchi ngs","volume":"22","author":"amar","year":"2005","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.05.016"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2003.08.004"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.12.002"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.12.003"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00263-7"}],"event":{"name":"2009 IEEE International Conference on Systems, Man and Cybernetics - SMC","start":{"date-parts":[[2009,10,11]]},"location":"San Antonio, TX, USA","end":{"date-parts":[[2009,10,14]]}},"container-title":["2009 IEEE International Conference on Systems, Man and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5340904\/5345886\/05345996.pdf?arnumber=5345996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:41:58Z","timestamp":1497825718000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5345996\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2009.5345996","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}