{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:22Z","timestamp":1759335922798},"reference-count":9,"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":5239,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1992,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>G<\/jats:italic> be a graph of order <jats:italic>n<\/jats:italic>. We show that if <jats:italic>G<\/jats:italic> is a 2\u2010connected graph and max{<jats:italic>d(u), d(v)<\/jats:italic>} + |<jats:italic>N(u)<\/jats:italic> U <jats:italic>N(v)<\/jats:italic>| \u2265 <jats:italic>n<\/jats:italic> for each pair of vertices <jats:italic>u, v<\/jats:italic> at distance two, then either <jats:italic>G<\/jats:italic> is hamiltonian or G \uf8fd3K<jats:sub>n\/3<\/jats:sub> U T<jats:sub>1<\/jats:sub> U T<jats:sub>2<\/jats:sub>, where n \uf8fd O (mod 3), and <jats:italic>T<\/jats:italic><jats:sub>1<\/jats:sub> and <jats:italic>T<\/jats:italic><jats:sub>2<\/jats:sub> are the edge sets of two vertex disjoint triangles containing exactly one vertex from each <jats:italic>K<\/jats:italic><jats:sub>n\/3<\/jats:sub>. This result generalizes both Fan's and Lindquester's results as well as several others.<\/jats:p>","DOI":"10.1002\/jgt.3190160203","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T02:44:52Z","timestamp":1181270692000},"page":"121-129","source":"Crossref","is-referenced-by-count":3,"title":["Hamiltonian graphs involving distances"],"prefix":"10.1002","volume":"16","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[]},{"given":"R. H.","family":"Schelp","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.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_3_2","unstructured":"H. J.Broersma J.van den Heuvel andH. J.Veldman A generalization of Ore's theorem involving neighborhood unions. Preprint."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140414"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90054-6"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90060-9"},{"key":"e_1_2_1_7_2","unstructured":"B.Jackson Neighbourhood unions and Hamilton cyces. Preprint."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130309"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2307\/2308928"},{"key":"e_1_2_1_10_2","unstructured":"Z. M.SongandK. M.Zheng A sufficient condition for a graph to be Hamiltonian. Preprint."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190160203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190160203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T11:48:09Z","timestamp":1698061689000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190160203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["10.1002\/jgt.3190160203"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190160203","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}