{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:51:52Z","timestamp":1729677112268,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/iscas.2015.7168591","type":"proceedings-article","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T17:31:36Z","timestamp":1438277496000},"page":"145-148","source":"Crossref","is-referenced-by-count":8,"title":["Building hamiltonian networks using the cycles laplacian of the underlying graph"],"prefix":"10.1109","author":[{"given":"Cristian E.","family":"Onete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Cristina C.","family":"Onete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0205049"},{"key":"ref11","article-title":"Enumerating all hamilton cycles and bounding the number of hamilton cycles in 3-regular graphs","volume":"18","author":"gebauer","year":"2011","journal-title":"Electr J Comb"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(74)90003-9"},{"key":"ref13","first-page":"111","article-title":"Planar Graphs, Regular Graphs, Bipartite Graphs and Hamiltonicity","volume":"20","author":"holton","year":"1999","journal-title":"Australasian Journal of Combinatorics"},{"key":"ref14","first-page":"310","article-title":"The icosian game revisited","volume":"11 3","author":"pegg","year":"2009","journal-title":"J of Mathematics"},{"year":"0","key":"ref15"},{"article-title":"Minimum Cycle Basis; Algorithms & Applications","year":"2006","author":"dimitrios","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2010.5537168"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SOCC.2013.6749712"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2012.6463705"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90165-0"},{"key":"ref7","first-page":"51","article-title":"Plane homogeneous graphs of degree three without Hamiltonian circuits","author":"grinberg","year":"1968","journal-title":"Latvian Math Yearbook 4 (in Russian) Riga Izdat"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5_1","article-title":"Graph Theory","author":"bondy","year":"2008","journal-title":"Graduate Texts in Mathematics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/2446"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00137"}],"event":{"name":"2015 IEEE International Symposium on Circuits and Systems (ISCAS)","start":{"date-parts":[[2015,5,24]]},"location":"Lisbon, Portugal","end":{"date-parts":[[2015,5,27]]}},"container-title":["2015 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7152138\/7168553\/07168591.pdf?arnumber=7168591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T12:44:47Z","timestamp":1498221887000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7168591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/iscas.2015.7168591","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}