{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T07:21:11Z","timestamp":1696749671948},"reference-count":4,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9712,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1980,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>G<\/jats:italic> be a graph of order <jats:italic>n<\/jats:italic> with exactly one Hamiltonian cycle and suppose that <jats:italic>G<\/jats:italic> is maximal with respect to this property. We determine the minimum number of edges <jats:italic>G<\/jats:italic> can have.<\/jats:p>","DOI":"10.1002\/jgt.3190040110","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:17:40Z","timestamp":1180419460000},"page":"93-100","source":"Crossref","is-referenced-by-count":1,"title":["Extremal maximal uniquely hamiltonian graphs"],"prefix":"10.1002","volume":"4","author":[{"given":"Curtiss A.","family":"Barefoot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C.","family":"Entringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","article-title":"Spanning cycles of nearly cubic graphs","author":"Entringer R. C.","journal-title":"J. Combinatorial Theory, Ser. B."},{"key":"e_1_2_1_3_2","first-page":"477","volume-title":"Recent Advances in Graph Theory","author":"Sheehan J.","year":"1975"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010110"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70511-9"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190040110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190040110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T15:25:39Z","timestamp":1696692339000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190040110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,3]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,3]]}},"alternative-id":["10.1002\/jgt.3190040110"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190040110","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,3]]}}}