{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T09:55:40Z","timestamp":1721037340544},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"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":[[1986,11]]},"DOI":"10.1016\/0020-0190(86)90135-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"195-200","source":"Crossref","is-referenced-by-count":47,"title":["Hamiltonian circuits in interval graph generalizations"],"prefix":"10.1016","volume":"23","author":[{"given":"Alan A.","family":"Bertossi","sequence":"first","affiliation":[]},{"given":"Maurizio A.","family":"Bonuccelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90135-3_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0020-0190(86)90135-3_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","article-title":"The edge Hamiltonian path problem is NP-complete","volume":"13","author":"Bertossi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(86)90135-3_BIB3","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\/0020-0190(86)90135-3_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(86)90135-3_BIB5","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90135-3_BIB6","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\/0020-0190(86)90135-3_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gravil","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(86)90135-3_BIB8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(86)90135-3_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(86)90135-3_BIB10","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/0211042","article-title":"The Hamiltonian circuit problem is polynomial for 4-connected planar graphs","volume":"11","author":"Gouyou-Beauchamps","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90135-3_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0601001","article-title":"Extremal values of the interval number of a graph","volume":"1","author":"Griggs","year":"1980","journal-title":"SIAM J. Algebraic Discr. Meths."},{"key":"10.1016\/0020-0190(86)90135-3_BIB12","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90135-3_BIB13","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0196-6774(82)90026-8","article-title":"The NP-completeness column: An ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(86)90135-3_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","article-title":"The NP-completeness column: An ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(86)90135-3_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\/0020-0190(86)90135-3_BIB16","series-title":"Recent Progress in Combinatorics","first-page":"301","article-title":"On the boxicity and cubicity of a graph","author":"Roberts","year":"1969"},{"key":"10.1016\/0020-0190(86)90135-3_BIB17","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190030302","article-title":"On double and multiple interval graphs","volume":"3","author":"Trotter","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0020-0190(86)90135-3_BIB18","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1090\/S0002-9904-1970-12628-3","article-title":"Characterizing circular arc graphs","volume":"76","author":"Tucker","year":"1970","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:50:42Z","timestamp":1553593842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086901353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["0020019086901353"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90135-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}