{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T22:33:46Z","timestamp":1698705226355},"reference-count":6,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6427,"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,3]]},"abstract":"Abstract<\/jats:title>We show that if G<\/jats:italic> is a 3\u2010connected graph of order at least seven, then every longest path between distinct vertices in G<\/jats:italic> contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges.<\/jats:p>","DOI":"10.1002\/jgt.3190130105","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:20:04Z","timestamp":1180182004000},"page":"17-21","source":"Crossref","is-referenced-by-count":15,"title":["Longest cycles in 3\u2010connected graphs contain three contractible edges"],"prefix":"10.1002","volume":"13","author":[{"given":"Nathaniel","family":"Dean","sequence":"first","affiliation":[]},{"given":"Robert L.","family":"Hemminger","sequence":"additional","affiliation":[]},{"given":"Katsuhiro","family":"Ota","sequence":"additional","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(87)90065-7"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_4_2","volume-title":"Proceedings of the Eighteenth Southeastern Conference on Combinatorics, Graph Theory and Computing","author":"Dean N.","year":"1987"},{"key":"e_1_2_1_4_3","first-page":"291","volume":"58","year":"1987","journal-title":"Congressus Numerantium"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90083-0"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(61)50045-5"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:52:29Z","timestamp":1697907149000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["10.1002\/jgt.3190130105"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130105","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,3]]}}}