{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:08Z","timestamp":1781077688832,"version":"3.54.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":6163,"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":[[1996,9]]},"DOI":"10.1016\/0012-365x(95)00057-4","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"291-298","source":"Crossref","is-referenced-by-count":112,"title":["Hamiltonian circuits in chordal bipartite graphs"],"prefix":"10.1016","volume":"156","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00057-4_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","article-title":"Finding Hamiltonian circuits in proper interval graphs","volume":"17","author":"Bertossi","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(95)00057-4_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(86)90135-3","article-title":"Hamiltonian circuits in interval graph generalizations","volume":"23","author":"Bertossi","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(95)00057-4_BIB3","series-title":"Schriftenreihe des FB Mathematik","article-title":"Special graph classes \u2014 a survey","author":"Brandst\u00e4dt","year":"1993"},{"key":"10.1016\/0012-365X(95)00057-4_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(95)00057-4_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(95)00057-4_BIB6","unstructured":"E. Dahlhaus, private communication."},{"key":"10.1016\/0012-365X(95)00057-4_BIB7","unstructured":"P. Damaschke, private communication."},{"key":"10.1016\/0012-365X(95)00057-4_BIB8","article-title":"Zur Kompliziertheit von hamiltonschen Problemen in speziellen Graphenklassen","author":"Damaschke","year":"1990"},{"key":"10.1016\/0012-365X(95)00057-4_BIB9","first-page":"383","article-title":"Finding hamiltonian paths in cocomparability graphs using the bump number algorithm, Order 8","author":"Damaschke","year":"1992"},{"key":"10.1016\/0012-365X(95)00057-4_BIB10","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/S0097539791200375","article-title":"Hamiltonian cycle is polynomial on cocomparability graphs","volume":"23","author":"Deogun","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00057-4_BIB11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00057-4_BIB12","series-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(95)00057-4_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(95)00057-4_BIB14","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamiltonian paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00057-4_BIB15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding Hamiltonian circuits in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(95)00057-4_BIB16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00057-4_BIB17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(93)90100-N","article-title":"Polynomial time algorithms for Hamiltonian problems on bipartite distance hereditary graphs","volume":"46","author":"M\u00fcller","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(95)00057-4_BIB18","series-title":"The Many Facets of Graph Theory","first-page":"237","article-title":"Hamiltonian circuits in graphs and digraphs","author":"Nash-Williams","year":"1969"},{"key":"10.1016\/0012-365X(95)00057-4_BIB19","article-title":"Strukturelle und algorithmische Aspekte distanz-erblicher Graphen und verwandter Klassen","author":"Nicolai","year":"1994"},{"key":"10.1016\/0012-365X(95)00057-4_BIB20","series-title":"Proc. 8th Ann. ACM Symp. on the Theory of Computing","first-page":"1","article-title":"Some complexity results for the traveling salesman problem","author":"Papadimitriou","year":"1976"},{"key":"10.1016\/0012-365X(95)00057-4_BIB21","first-page":"525","article-title":"Graph algorithms","volume":"Vol. A","author":"van Leeuwen","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95000574?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95000574?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:24:40Z","timestamp":1556130280000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95000574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0012365X95000574"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00057-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}