{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:13:17Z","timestamp":1758823997744},"reference-count":9,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10267,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A graph G is called hypohamiltonian if G is not hamiltonian but every vertex\u2010deleted subgraph G\u2010v is hamiltonian. The existence of a p\u2010vertex hypohamiltonian graph is open only for p = 14,17, and the existence of a p\u2010vertex, cubic hypohamiltonian graph is open only for p = 14,16,24,32. With the aid of a computer we have established that there is no hypohamiltonian graph of order 14, and no cubic hypohamiltonian graph of order 14 or 16. In addition, there is no hypohamiltonian graph of order 17 with girth \u2265 5. On the other hand, new p\u2010vertex, cubic hypohamiltonian graphs have been found for p = 18,22.<\/jats:p>","DOI":"10.1002\/net.3230080303","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:49:55Z","timestamp":1178873395000},"page":"193-200","source":"Crossref","is-referenced-by-count":13,"title":["Systematic searches for hypohamiltonian graphs"],"prefix":"10.1002","volume":"8","author":[{"given":"J. B.","family":"Collier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. F.","family":"Schmeichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1972-012-3"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1973-008-9"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90130-3"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90020-5"},{"key":"e_1_2_1_6_2","first-page":"214","article-title":"Solution du Probleme No. 29","volume":"8","author":"Gaudin T.","year":"1964","journal-title":"Rev. Franc. Rech. Operat."},{"key":"e_1_2_1_7_2","first-page":"153","volume-title":"Theorie des Graphes, Proc. 1966 Internl. Symp. in Rome","author":"Herz J. C.","year":"1967"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.2307\/2313617"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90074-0"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90128-9"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:43:01Z","timestamp":1699778581000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,9]]}},"alternative-id":["10.1002\/net.3230080303"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080303","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,9]]}}}