{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T18:59:09Z","timestamp":1778871549445,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90003-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"211-227","source":"Crossref","is-referenced-by-count":80,"title":["A recognition algorithm for the intersection graphs of paths in trees"],"prefix":"10.1016","volume":"23","author":[{"given":"F\u0103nic\u0103","family":"Gavril","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90003-1_BIB1","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(78)90003-1_BIB2","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(78)90003-1_BIB3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(78)90003-1_BIB4","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. Combinatorial Theory Ser. B"},{"key":"10.1016\/0012-365X(78)90003-1_BIB5","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":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(78)90003-1_BIB6","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(78)90003-1_BIB7","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0012-365X(78)90003-1_BIB8","doi-asserted-by":"crossref","first-page":"810","DOI":"10.2307\/2317880","article-title":"What are the intersection graphs of arcs in a circle?","volume":"76","author":"Klee","year":"1969","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/0012-365X(78)90003-1_BIB9","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(78)90003-1_BIB10","doi-asserted-by":"crossref","first-page":"501","DOI":"10.2140\/pjm.1970.34.501","article-title":"Intersection representations of graphs by arcs","volume":"34","author":"Renz","year":"1970","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(78)90003-1_BIB11","unstructured":"F.S. Roberts, Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems (Prentice-Hall, Englewood Cliffs, NJ, to appear)."},{"key":"10.1016\/0012-365X(78)90003-1_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/800116.803775","article-title":"Algorithmic aspects of vertex elimination","author":"Rose","year":"1975","journal-title":"Proc. Seventh Ann. ACM Symp. on the Theory of Computing"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900031?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900031?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:13:33Z","timestamp":1580897613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78900031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78900031"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90003-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}