{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T14:18:22Z","timestamp":1778077102118,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":8294,"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,11]]},"DOI":"10.1016\/0012-365x(90)90163-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"59-72","source":"Crossref","is-referenced-by-count":60,"title":["Extending cycles in graphs"],"prefix":"10.1016","volume":"85","author":[{"given":"George R.T.","family":"Hendry","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90163-C_BIB1","series-title":"Graphs and Digraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0012-365X(90)90163-C_BIB2","series-title":"Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing","first-page":"167","article-title":"Pancyclic graphs","author":"Bondy","year":"1971"},{"key":"10.1016\/0012-365X(90)90163-C_BIB3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","article-title":"Pancyclic graphs I","volume":"11","author":"Bondy","year":"1971","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(90)90163-C_BIB4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4153\/CMB-1972-012-3","article-title":"Variations on the hamiltonian theme","volume":"15","author":"Bondy","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(90)90163-C_BIB5","series-title":"The Theory and Applications of Graphs","first-page":"117","article-title":"Integrity in graph theory","author":"Bondy","year":"1981"},{"key":"10.1016\/0012-365X(90)90163-C_BIB6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","article-title":"A method in graph theory","volume":"15","author":"Bondy","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90163-C_BIB7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90163-C_BIB8","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/0116056","article-title":"Randomly traceable graphs","volume":"16","author":"Chartrand","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(90)90163-C_BIB9","first-page":"199","article-title":"Hamiltonian properties of connected locally connected graphs","volume":"32","author":"Clark","year":"1981","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90163-C_BIB10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0012-365X(90)90163-C_BIB11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(90)90163-C_BIB12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01349245","article-title":"Graph in which every finite path is contained in a circuit","volume":"203","author":"Dirac","year":"1973","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(90)90163-C_BIB13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","article-title":"The square of every two-connected graph is hamiltonian","volume":"16","author":"Fleischner","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90163-C_BIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01305995","article-title":"In the square of graphs, hamiltonicity and pancyclicity, hamiltonian connectedness and panconnectedness are equivalent concepts","volume":"82","author":"Fleischner","year":"1976","journal-title":"Monatsh. Math."},{"key":"10.1016\/0012-365X(90)90163-C_BIB15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.4153\/CMB-1976-025-3","article-title":"Hamiltonian cycles in squares of vertex-unicyclic graphs","volume":"19","author":"Fleischner","year":"1976","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(90)90163-C_BIB16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90163-C_BIB17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(82)90216-3","article-title":"Forbidden subgraphs and hamiltonian properties of graphs","volume":"42","author":"Gould","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90163-C_BIB18","series-title":"Ph.D. Thesis","article-title":"On paths, factors and cycles in graphs","author":"Hendry","year":"1985"},{"key":"10.1016\/0012-365X(90)90163-C_BIB19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/jgt.3190110312","article-title":"On the hamiltonian path graph of a graph","volume":"11","author":"Hendry","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90163-C_BIB20","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0095-8956(89)90042-7","article-title":"Extending cycles in digraphs","volume":"46","author":"Hendry","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90163-C_BIB21","doi-asserted-by":"crossref","unstructured":"G.R.T. Hendry, Extending cycles in bipartite graphs, J. Combin. Theory, submitted.","DOI":"10.1016\/0095-8956(91)90044-K"},{"key":"10.1016\/0012-365X(90)90163-C_BIB22","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1002\/jgt.3190090415","article-title":"The square of a connected S(K1,3)-free graph is vertex pancyclic","volume":"9","author":"Hendry","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90163-C_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(76)90061-7","article-title":"The square of a block is vertex pancyclic","volume":"20","author":"Hobbs","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90163-C_BIB24","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190030405","article-title":"Every connected, locally connected nontrivial graph with no induced claw is hamiltonian","volume":"3","author":"Oberly","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90163-C_BIB25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","article-title":"Note on hamilton circuits","volume":"67","author":"Ore","year":"1960","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(90)90163-C_BIB26","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02412090","article-title":"Arc coverings of graphs","volume":"55","author":"Ore","year":"1961","journal-title":"Ann. Mat. Pura Appl."},{"key":"10.1016\/0012-365X(90)90163-C_BIB27","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0012-365X(90)90163-C_BIB28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190020311","article-title":"Representations of chordal graphs as subtrees of a tree","volume":"2","author":"Walter","year":"1978","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090163C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090163C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:35Z","timestamp":1555129535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090163C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0012365X9090163C"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90163-c","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}