{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:40:50Z","timestamp":1698043250701},"reference-count":8,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6335,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,6]]},"abstract":"Abstract<\/jats:title>It is proved that a 4\u2010connected, \u03b4\u2010regular graph G<\/jats:italic> either is Hamiltonian, or has at least 3\u03b4 + 1 vertices and contains a cycle of length at least min{4\u03b4 \u2010 4, 1\/2 (|G| + 3\u03b4 \u2010 2)}. Examples supplied by B. Jackson and H.A. Jung show that min{4\u03b4 \u2010 4, 1\/2(|G| + 3\u03b4 \u2010 2)} cannot be replaced by 4\u03b4 + 1.<\/jats:p>","DOI":"10.1002\/jgt.3190130203","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:51:22Z","timestamp":1181350282000},"page":"149-155","source":"Crossref","is-referenced-by-count":0,"title":["Circumference of a regular graph"],"prefix":"10.1002","volume":"13","author":[{"given":"Min","family":"Aung","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90058-9"},{"key":"e_1_2_1_3_2","unstructured":"P.Fraisse D\u03bb\u2010cycles and their applications for Hamiltonian graphs D.Sc. thesis Universite De Paris\u2010Sud (1986)29\u201349."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90042-8"},{"key":"e_1_2_1_5_2","unstructured":"B.Jackson H.Li andY.\u2010J.Zhu Dominating cycles in regular 3\u2010connected graphs submitted."},{"key":"e_1_2_1_6_2","first-page":"403","volume-title":"Colloquia Mathematica Societatis Janos Bolyai, 37. Finite and Infinite sets","author":"Jung H. A.","year":"1981"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02941511"},{"key":"e_1_2_1_8_2","unstructured":"H. A.Jung Longestab\u2010paths in regular graphs Graph Theory(issue in Memory of G. A. Dirac) to appear."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(73)90038-5"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T13:32:18Z","timestamp":1697981538000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["10.1002\/jgt.3190130203"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130203","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}