{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:11:44Z","timestamp":1699834304641},"reference-count":7,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8890,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1982,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>r<\/jats:italic>\u2267 3 be an integer. It is shown that there exists \u03b5= \u03b5(<jats:italic>r<\/jats:italic>), 0 &lt; \u03b5 &lt; 1, and an integer <jats:italic>N<\/jats:italic> = <jats:italic>N(r<\/jats:italic>) &gt; 0 such that for all <jats:italic>n<\/jats:italic> \u2267 <jats:italic>N<\/jats:italic> (if <jats:italic>r<\/jats:italic> is even) or for all even <jats:italic>n<\/jats:italic> \u2267 <jats:italic>N<\/jats:italic>(if <jats:italic>r<\/jats:italic> is odd), there is an <jats:italic>r<\/jats:italic>\u2010connected regular graph of valency <jats:italic>r<\/jats:italic> on exactly <jats:italic>n<\/jats:italic> vertices whose longest cycles have fewer than <jats:italic>n<\/jats:italic><jats:sup>\u03b5<\/jats:sup> vertices.<\/jats:p>","DOI":"10.1002\/jgt.3190060211","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:55:50Z","timestamp":1180421750000},"page":"169-176","source":"Crossref","is-referenced-by-count":3,"title":["A shortness exponent for <i>r<\/i>\u2010regular <i>r<\/i>\u2010connected graphs"],"prefix":"10.1002","volume":"6","author":[{"given":"Brad","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. D.","family":"Parsons","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","volume-title":"Algebraic Combinatorics","author":"Babai L.","year":"1979"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1980-076-2"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90012-5"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.48.7.1142"},{"key":"e_1_2_1_6_2","article-title":"Longest cycles in r\u2010regular r\u2010connected graphs","author":"Jackson B.","journal-title":"J. Combinatorial Theory."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700007589"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(73)80006-1"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190060211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190060211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:21:46Z","timestamp":1699766506000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190060211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["10.1002\/jgt.3190060211"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190060211","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}