{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T05:13:18Z","timestamp":1682485998434},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0012-365x(94)00002-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:36:38Z","timestamp":1027604198000},"page":"1-19","source":"Crossref","is-referenced-by-count":5,"title":["A common generalization of Chv\u00e1tal-Erd\u0151s' and Fraisse's sufficient conditions for hamiltonian graphs"],"prefix":"10.1016","volume":"142","author":[{"given":"A.","family":"Ainouche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00002-Z_BIB1","article-title":"Connectivity, independent sets and maximal circuits in undirected graphs","author":"Ainouche","year":"1980"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0012-365X(91)90367-B","article-title":"Four sufficient conditions for hamiltonian graphs","volume":"89","author":"Ainouche","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00002-Z_BIB3","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1002\/jgt.3190160602","article-title":"An improvement of Fraisse's sufficient condition for hamiltonian graphs","volume":"16","author":"Ainouche","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(87)90025-4","article-title":"Semi-independence number of a graph and the existence of Hamiltonian circuits","volume":"17","author":"Ainouche","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)00002-Z_BIB5","doi-asserted-by":"crossref","unstructured":"A. Ainouche and I. Schiermeyer, Insertible vertices, neighborhood intersections and hamiltonicity, J. Graph Theory, to appear.","DOI":"10.1002\/jgt.3190200203"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0095-8956(89)90023-3","article-title":"A generalization of a result of H\u00e4ggkvist and Nicoghossian","volume":"47","author":"Bauer","year":"1989","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB7","doi-asserted-by":"crossref","unstructured":"D. Bauer, G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Math. to appear.","DOI":"10.1016\/0012-365X(91)90468-H"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90055-M","article-title":"Long cycles in graphs with large degree sums","volume":"79","author":"Bauer","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00002-Z_BIB9","unstructured":"J.A. Bondy, Longest paths and cycles in graphs of high degree, Research Report CORR 80-16, Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont. Canada."},{"key":"10.1016\/0012-365X(94)00002-Z_BIB10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(78)90124-3","article-title":"A remark on two sufficient conditions for hamilton cycles","volume":"22","author":"Bondy","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00002-Z_BIB11","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/jgt.3190140414","article-title":"One sufficient condition for Hamiltonian Graphs","volume":"14","author":"Chen","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","article-title":"A note on Hamiltonian circuits","volume":"2","author":"Chv\u00e1tal","year":"1972","journal-title":"Discrete Math"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB13","first-page":"69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB14","series-title":"Neighborhood unions and highly Hamiltonian graphs","author":"Faudree","year":"1988"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(89)90060-9","article-title":"Neighborhood unions and Hamiltonian properties in Graphs","volume":"B47","author":"Faudree","year":"1989","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(91)90094-I","article-title":"Hamiltonian, degree sums and neighborhood intersections","volume":"90","author":"Flandrin","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00002-Z_BIB17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/jgt.3190100316","article-title":"A new sufficient condition for Hamiltonian graphs","volume":"10","author":"Fraisse","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","article-title":"Note on Hamiltonian circuits","volume":"67","author":"Ore","year":"1960","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB19","first-page":"49","article-title":"On generalizing a theorem of Fraisse","volume":"29 A","author":"Schiermeyer","year":"1990","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(94)00002-Z_BIB20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0012-365X(93)90183-T","article-title":"Computation of the 0-dual closure for hamiltonian graphs","volume":"111","author":"Schiermeyer","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00002-Z_BIB21","series-title":"A note on the paper \u2018A new sufficient condition for hamiltonian graphs\u2019","author":"Tian","year":"1989"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400002Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400002Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:22:04Z","timestamp":1556115724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400002Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0012365X9400002Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00002-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}