{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:54Z","timestamp":1759063614194},"reference-count":9,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6243,"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,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>G<\/jats:italic> be 2\u2010connected graph with girth <jats:italic>g<\/jats:italic> and minimum degree <jats:italic>d<\/jats:italic>. Then each pair of vertices of <jats:italic>G<\/jats:italic> is joined by a path of length at least max{1\/2(<jats:italic>d<\/jats:italic> \u2212 1)<jats:italic>g<\/jats:italic>, (<jats:italic>d<\/jats:italic> \u2212 3\/2)(<jats:italic>g<\/jats:italic> \u2212 4) + 2} if <jats:italic>g<\/jats:italic> \u2a7e 4, and the length of a longest cycle of <jats:italic>G<\/jats:italic> is at least max{[(<jats:italic>d<\/jats:italic> \u2212 1)(<jats:italic>g<\/jats:italic> \u2212 2) + 2], [(2<jats:italic>d<\/jats:italic> \u2212 3)(<jats:italic>g<\/jats:italic> \u2212 4) + 4]}.<\/jats:p>","DOI":"10.1002\/jgt.3190130409","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:23:48Z","timestamp":1180182228000},"page":"485-490","source":"Crossref","is-referenced-by-count":5,"title":["Circumference and girth"],"prefix":"10.1002","volume":"13","author":[{"given":"Cun\u2010Quan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Extremal Graph Theory","author":"Bollobas B.","year":"1978"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90058-9"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70737-4"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090208"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(67)80036-X"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100023720"},{"key":"e_1_2_1_9_2","first-page":"57","article-title":"Maximal gerade und ungerade Kreise in Graphen","volume":"23","author":"Voss H.\u2010J.","year":"1977","journal-title":"I. Wiss. Z. Tech. Hochsch. Ilmenau"},{"key":"e_1_2_1_10_2","unstructured":"C. Q.ZhangandY. J.Zhu Long path connectivity of regular graphs."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T14:04:10Z","timestamp":1697983450000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["10.1002\/jgt.3190130409"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130409","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,9]]}}}