{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:52Z","timestamp":1759063552905},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(98)00127-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"239-256","source":"Crossref","is-referenced-by-count":13,"title":["The forbidden subgraph characterization of directed vertex graphs"],"prefix":"10.1016","volume":"196","author":[{"given":"B.S.","family":"Panda","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00127-7_BIB1","series-title":"Topics on perfect graphs","volume":"21","year":"1984"},{"key":"10.1016\/S0012-365X(98)00127-7_BIB2","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\/S0012-365X(98)00127-7_BIB3","article-title":"Intersection graph algorithms, TR 84-628","author":"Deitz","year":"1984"},{"key":"10.1016\/S0012-365X(98)00127-7_BIB4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ., Hamburg"},{"key":"10.1016\/S0012-365X(98)00127-7_BIB5","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\/S0012-365X(98)00127-7_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\/S0012-365X(98)00127-7_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":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00127-7_BIB8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90070-5","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\/S0012-365X(98)00127-7_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(98)00127-7_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 interval on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fundam. Math."},{"key":"10.1016\/S0012-365X(98)00127-7_BIB11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","article-title":"Intersection graphs of paths in a tree","volume":"41","author":"Monma","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00127-7_BIB12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(94)00163-9","article-title":"Intersection graphs of vertex disjoint paths in a tree","volume":"146","author":"Panda","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00127-7_BIB13","doi-asserted-by":"crossref","first-page":"501","DOI":"10.2140\/pjm.1970.34.501","article-title":"Intersection representation of graphs by arcs","volume":"34","author":"Renz","year":"1970","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(98)00127-7_BIB14","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0012-365X(98)00127-7_BIB15","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\/S0012-365X(98)00127-7_BIB16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(93)90116-6","article-title":"A faster algorithm to recognize undirected path graphs","volume":"43","author":"Schaffer","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(98)00127-7_BIB17","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(98)00127-7_BIB18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190020311","article-title":"Representation of chordal graphs as subtress of a tree","volume":"2","author":"Walter","year":"1978","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001277?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001277?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:55:18Z","timestamp":1556132118000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0012365X98001277"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00127-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}