{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T02:15:01Z","timestamp":1787364901289,"version":"build-2736575974"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>In 1990, Hendry Conjectured that every Hamiltonian chordal graph is cycle extendable; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater. We disprove this conjecture by constructing counterexamples on $n$ vertices for any $n \\geq 15$. Furthermore, we show that there exist counterexamples where the ratio of the length of a nonextendable cycle to the total number of vertices can be made arbitrarily small. We then consider cycle extendability in Hamiltonian chordal graphs where certain induced subgraphs are forbidden, notably $P_n$ and the bull.<\/jats:p>","DOI":"10.1137\/13094551x","type":"journal-article","created":{"date-parts":[[2015,5,14]],"date-time":"2015-05-14T12:05:28Z","timestamp":1431605128000},"page":"877-887","source":"Crossref","is-referenced-by-count":7,"title":["Hamiltonian Chordal Graphs are not Cycle Extendable"],"prefix":"10.1137","volume":"29","author":[{"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Seamone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,5,14]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/130914164"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104441267"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90016-5"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"A. Brandsta\u0308dt, V. B. Le, and J. P. Spinrad,\n                      Graph Classes: A Survey\n                      , SIAM, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"atypb5","first-page":"158","volume":"99","author":"Chartrand G.","year":"1974","journal-title":"C\u030casopis Pe\u030cst. Mat."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104441450"},{"key":"atypb7","first-page":"199","author":"Clark L.","year":"1981","journal-title":"LA"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02992776"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90154-1"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1965.15.835"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.10.005"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90163-C"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00505-8"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190180505"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.11.035"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/13094551X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:24:58Z","timestamp":1787322298000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/13094551X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/13094551X"],"URL":"https:\/\/doi.org\/10.1137\/13094551x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}