{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:06:14Z","timestamp":1742385974971},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90100-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"225-230","source":"Crossref","is-referenced-by-count":14,"title":["Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"Nicolai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90100-N_BIB1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(86)90018-8","article-title":"Chordality properties on graphs and minimal conceptual connections in semantic data models","volume":"33","author":"Ausiello","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90100-N_BIB2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(93)90100-N_BIB3","series-title":"Computers and Intractability, A guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(93)90100-N_BIB4","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(93)90100-N_BIB5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(93)90100-N_BIB6","series-title":"Forschungsergebnisse N\/87\/36","article-title":"The NP-completeness of HAMILTONIAN CIRCUIT for chordal bipartite graphs","author":"M\u00fcller","year":"1987"},{"key":"10.1016\/0020-0190(93)90100-N_BIB7","unstructured":"F. Nicolai, A polynomial time algorithm solving the HAMILTONIAN CIRCUIT problem on ptolemaic graphs, Manuscript."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390100N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390100N?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:27:35Z","timestamp":1555129655000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390100N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390100N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90100-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}