{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:40:46Z","timestamp":1698043246267},"reference-count":4,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6152,"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,12]]},"abstract":"Abstract<\/jats:title>Let G<\/jats:italic> be a simple non\u2010hamiltonian graph, let C<\/jats:italic> be a longest cycle in G<\/jats:italic>, and let p<\/jats:italic> be a positive integer. By considering a special form of connectivity, we obtain a sufficient condition on degrees for the nonexistence of (p<\/jats:italic> \u2010 1)\u2010path\u2010connected components in G<\/jats:italic> \u2010 C<\/jats:italic>.<\/jats:p>","DOI":"10.1002\/jgt.3190130605","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T19:50:55Z","timestamp":1181332255000},"page":"697-702","source":"Crossref","is-referenced-by-count":0,"title":["On longest cycles and strongly linking vertex sets"],"prefix":"10.1002","volume":"13","author":[{"given":"Bert","family":"Fassbender","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"J. A.Bondy Longest paths and cycles in graphs of high degree. University of Waterloo Preprint CORR80\u201376."},{"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","unstructured":"B.Fassbender Varianten und Erg\u00e4nzungen zu einigen valenzbezogenen Aussagen \u00fcber l\u00e4ngste Kreise in Graphen. Dissertation K\u00f6ln (1987)."},{"key":"e_1_2_1_5_2","first-page":"157","volume-title":"Studies in Pure Mathematics","author":"Nash\u2010Williams C. St. J. A.","year":"1971"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130605","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T02:57:14Z","timestamp":1697943434000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":4,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["10.1002\/jgt.3190130605"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130605","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,12]]}}}