{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T09:49:45Z","timestamp":1721036985163},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"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":9847,"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":[[1986,8]]},"DOI":"10.1016\/0012-365x(86)90031-2","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"93-101","source":"Crossref","is-referenced-by-count":35,"title":["Neighborhood perfect graphs"],"prefix":"10.1016","volume":"61","author":[{"given":"J","family":"Lehel","sequence":"first","affiliation":[]},{"given":"Zs","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(86)90031-2_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(86)90031-2_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(86)90031-2_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(83)90088-2","article-title":"Graphs whose neighborhoods have no special cycles","volume":"47","author":"Brower","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(86)90031-2_BIB4","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(86)90031-2_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterization of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(86)90031-2_BIB6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120921","article-title":"Khachian's algorithm for linear programming","volume":"14","author":"G\u00e1cs","year":"1981","journal-title":"Math. Program. Studies"},{"key":"10.1016\/0012-365X(86)90031-2_BIB7","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"},{"key":"10.1016\/0012-365X(86)90031-2_BIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","article-title":"Trivially perfect graphs","volume":"24","author":"Golumbic","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(86)90031-2_BIB9","series-title":"Combinatorial Theory and its Applications II","first-page":"571","article-title":"A Helly-type problem in trees","author":"Gy\u00e1rf\u00e1s","year":"1970"},{"key":"10.1016\/0012-365X(86)90031-2_BIB10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0012-365X(86)90031-2_BIB11","series-title":"The neighbourhood number of a graph","author":"Neeralagi","year":"1984"},{"key":"10.1016\/0012-365X(86)90031-2_BIB12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(86)90031-2_BIB13","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality on graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(86)90031-2_BIB14","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"},{"key":"10.1016\/0012-365X(86)90031-2_BIB15","first-page":"17","article-title":"A note on \u201cThe comparability graph of a tree\u201d","volume":"16","author":"Wolk","year":"1965"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86900312?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86900312?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:53:11Z","timestamp":1553946791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86900312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["0012365X86900312"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90031-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}