{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T09:45:06Z","timestamp":1698227106220},"reference-count":7,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4327,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For a simple graph <jats:italic>G<\/jats:italic> of order <jats:italic>n<\/jats:italic> \u2267 3, define \u03b8(<jats:italic>G<\/jats:italic>) = min{(<jats:italic>d<\/jats:italic>(<jats:italic>A<\/jats:italic>, <jats:styled-content>A<\/jats:styled-content>))\/|<jats:styled-content>A<\/jats:styled-content>|; \u00d8 \u00f8 <jats:italic>A<\/jats:italic> \u2260 <jats:italic>V<\/jats:italic>}. We shall prove the following Chv\u00e1tal\u2013Erd\u0151s type condition: If \u03b1(<jats:italic>G<\/jats:italic>) \u2266 \u03b8(<jats:italic>G<\/jats:italic>)<jats:italic>n<\/jats:italic>, then <jats:italic>G<\/jats:italic> is Hamiltonian.<\/jats:p>","DOI":"10.1002\/jgt.3190180804","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T16:19:24Z","timestamp":1181233164000},"page":"791-800","source":"Crossref","is-referenced-by-count":3,"title":["A chv\u00e1tal\u2013erd\u0151s type condition for hamiltonian graphs"],"prefix":"10.1002","volume":"18","author":[{"given":"Xiaoyun","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"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","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90079-9"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"98","author":"Fiedler M.","year":"1973","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_6_2","unstructured":"P.Fraisse D\u03bb\u2010cycles and their applications for Hamiltonian graphs. Universit\u00e9 de Paris\u2010Sud. Preprint (1986)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90030-2"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190160310"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190180804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190180804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T14:24:45Z","timestamp":1698157485000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190180804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":7,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1002\/jgt.3190180804"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190180804","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}