{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T01:14:07Z","timestamp":1777511647789,"version":"3.51.4"},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"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":[[1990,10]]},"DOI":"10.1016\/0012-365x(90)90130-a","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"241-254","source":"Crossref","is-referenced-by-count":36,"title":["Chv\u00e1tal-Erdo\u030bs conditions for paths and cycles in graphs and digraphs. A survey"],"prefix":"10.1016","volume":"84","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Ordaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90130-A_BIB1","unstructured":"D. Amar, I. Fournier and A. Germa, Existence de cycles de longuer fix\u00e9e dans un graphe verifiant la condition de Chv\u00e1tal et Erdo\u030bs, submitted to Graphs and Combinatorics."},{"key":"10.1016\/0012-365X(90)90130-A_BIB2","first-page":"11","article-title":"Structure des graphs de connexit\u00e9 k\u2a7e2 et de stabilit\u00e9 \u03b1 = k + 2","volume":"17","author":"Amar","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB3","first-page":"43","article-title":"Covering of vertices of a simple graph with given connectivity and independence number","volume":"20","author":"Amar","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB4","series-title":"Ph.D thesis","author":"Ash","year":"1985"},{"key":"10.1016\/0012-365X(90)90130-A_BIB5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(87)90115-4","article-title":"The Chv\u00e1tal\u2013Erdo\u030bs condition and pancyclic line graphs","volume":"66","author":"Benhocine","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB6","series-title":"Graphs","author":"Berge","year":"1983"},{"key":"10.1016\/0012-365X(90)90130-A_BIB7","series-title":"Problem 3 in Recent Advances in Graph Theory Proc. Call. Prague","first-page":"541","author":"Bermond","year":"1975"},{"key":"10.1016\/0012-365X(90)90130-A_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01295234","article-title":"\u00dcber Hamiltonsche Kreise und Unabh\u00e4ngige Ecken in Graphen","volume":"88","author":"Bigalke","year":"1979","journal-title":"Monatsh. Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB9","first-page":"181","article-title":"Pancyclic graphs: recent results. Colloq. Math. Soc. Janos Bolyai","volume":"10","author":"Bondy","year":"1973","journal-title":"Infinite and finite sets"},{"key":"10.1016\/0012-365X(90)90130-A_BIB10","series-title":"Research Report Corr. 80-16","article-title":"Longest paths and cycles in graphs of high degree","author":"Bondy","year":"1980"},{"key":"10.1016\/0012-365X(90)90130-A_BIB11","series-title":"Research Report Dept. Comb. Opt.","article-title":"Hamilton cycles in graphs and digraphs","author":"Bondy","year":"1975"},{"key":"10.1016\/0012-365X(90)90130-A_BIB12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1112\/jlms\/s2-14.2.277","article-title":"Diconnected orientations and a conjecture of Las Vegnas","volume":"2","author":"Bondy","year":"1976","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(90)90130-A_BIB13","first-page":"2151","article-title":"Chemins et circuit hamiltoniens des graphes complets","volume":"249","author":"Camion","year":"1959","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(90)90130-A_BIB14","unstructured":"N. Chakroun and D. Sotteau, Chv\u00e1tal\u2013Erdo\u030bs theorem for digraphs, submitted to Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(83)90188-7","article-title":"Every finite strongly connected digraph of stability 2 has a hamilton path","volume":"44","author":"Chen","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","article-title":"A note on Hamilton circuits","volume":"2","author":"Chv\u00e1tal","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB17","first-page":"248","article-title":"probl\u00e8mes","author":"Fouquet","year":"1976","journal-title":"Probl\u00e8mes combinatoires et th\u00e9orie des graphes"},{"key":"10.1016\/0012-365X(90)90130-A_BIB18","series-title":"L.R.I.","article-title":"Th\u00e8se d'Etat","author":"Fournier","year":"1985"},{"key":"10.1016\/0012-365X(90)90130-A_BIB19","series-title":"Cycles in Graphs","first-page":"201","article-title":"Longest cycles in 2-connected graphs","author":"Fournier","year":"1985"},{"key":"10.1016\/0012-365X(90)90130-A_BIB20","doi-asserted-by":"crossref","unstructured":"I. Fournier and P. Fraisse, On a conjecture of Bondy, J. Combin. Theory Ser. B 39, 17-25.","DOI":"10.1016\/0095-8956(85)90035-8"},{"key":"10.1016\/0012-365X(90)90130-A_BIB21","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/jgt.3190100316","article-title":"A new sufficient condition for hamiltonian circuits","volume":"10","author":"Fraisse","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90130-A_BIB22","unstructured":"P. Fraisse, D\u03bb-cycles and their application for hamilton graphs, submitted to Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB23","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0012-365X(88)90067-2","article-title":"A Chv\u00e1tal\u2013Erdo\u030bs condition for (t, t)-factor in digraphs using given arcs","volume":"71","author":"Fraisse","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB24","first-page":"181","article-title":"Verallgemeinerung eines Graphentheoretischen Satzes von Redei","volume":"21","author":"Gallai","year":"1960","journal-title":"Acta Sci. Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB25","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0095-8956(81)90102-7","article-title":"A remark on hamiltonian cycles","volume":"30","author":"H\u00e4ggkvist","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90130-A_BIB26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(82)90078-4","article-title":"Circuits through specified edges","volume":"41","author":"H\u00e4ggkvist","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.2307\/2315334","article-title":"The theory of round robin tournaments","volume":"73","author":"Harary","year":"1966","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(90)90130-A_BIB28","series-title":"Cycles in Graphs","first-page":"287","article-title":"Minimum number of circuits covering the vertices of a strong digraph","author":"Heydemann","year":"1985"},{"key":"10.1016\/0012-365X(90)90130-A_BIB29","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0095-8956(87)90001-3","article-title":"A Chv\u00e1tal\u2013Erdo\u030bs condition for hamilton cycles in digraphs","volume":"43","author":"Jackson","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90130-A_BIB30","first-page":"29","article-title":"Chv\u00e1tal\u2013Erdo\u030bs conditions for 2-cyclability in digraphs","volume":"25","author":"Jackson","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90130-A_BIB31","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(85)90169-4","article-title":"A Chv\u00e1tal\u2013Erdo\u030bs condition for (1, 1)-factors in digraphs","volume":"57","author":"Jackson","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB32","series-title":"L.R.I.","article-title":"Th\u00e8se de 3ieme cycle","author":"Mannoussakis","year":"1985"},{"key":"10.1016\/0012-365X(90)90130-A_BIB33","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0095-8956(73)90057-9","article-title":"Une conditions suffisante d'existence d'un circuit hamiltonien dans un graphe orient\u00e9","volume":"14","author":"Meyniel","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90130-A_BIB34","series-title":"Pure Mathematics","first-page":"157","article-title":"Edge-disjoint hamiltonian circuits in graphs with vertices of large valency","author":"Nash-Williams","year":"1971"},{"key":"10.1016\/0012-365X(90)90130-A_BIB35","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1112\/plms\/s3-42.2.231","article-title":"Long cycles in digraphs","volume":"42","author":"Thomassen","year":"1981","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0012-365X(90)90130-A_BIB36","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(77)90122-4","article-title":"An Ore-type condition implying a digraph to be pancyclic","volume":"19","author":"Thomassen","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90130-A_BIB37","series-title":"Graph Theory and Combinatorics","first-page":"305","article-title":"Connectivity in tournaments","author":"Thomassen","year":"1984"},{"key":"10.1016\/0012-365X(90)90130-A_BIB38","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(83)90196-6","article-title":"Existence of D\u03bb-cycles and D\u03bb-paths","volume":"44","author":"Veldman","year":"1983","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090130A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090130A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:03:45Z","timestamp":1580882625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090130A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0012365X9090130A"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90130-a","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}