{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T09:54:41Z","timestamp":1755597281975},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T00:00:00Z","timestamp":1481068800000},"content-version":"vor","delay-in-days":1467,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1016\/j.tcs.2012.06.019","type":"journal-article","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T10:30:11Z","timestamp":1340447411000},"page":"73-83","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Chordal digraphs"],"prefix":"10.1016","volume":"463","author":[{"given":"Daniel","family":"Meister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2012.06.019_br000005","series-title":"Digraphs. Theory, Algorithms and Applications","author":"Bang-Jensen","year":"2000"},{"key":"10.1016\/j.tcs.2012.06.019_br000010","series-title":"Sparse Matrix Computations: Graph Theory Issues and Algorithms","first-page":"1","article-title":"An introduction to chordal graphs and clique trees","author":"Blair","year":"1993"},{"key":"10.1016\/j.tcs.2012.06.019_br000015","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterisation of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.tcs.2012.06.019_br000020","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":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"10.1016\/j.tcs.2012.06.019_br000025","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/j.dam.2011.04.016","article-title":"Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms","volume":"160","author":"Feder","year":"2012","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.tcs.2012.06.019_br000030","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":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.tcs.2012.06.019_br000035","first-page":"739","article-title":"Bipartite intersection graphs","volume":"23","author":"Harary","year":"1982","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"10.1016\/j.tcs.2012.06.019_br000040","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/0202018","article-title":"Toward characterization of perfect elimination digraphs","volume":"2","author":"Haskins","year":"1973","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.tcs.2012.06.019_br000045","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.tcs.2008.02.038","article-title":"Digraph measures: Kelly decompositions, games, and orderings","volume":"399","author":"Hunter","year":"2008","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2012.06.019_br000050","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/0203022","article-title":"A note on perfect elimination digraphs","volume":"3","author":"Kleitman","year":"1974","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.tcs.2012.06.019_br000055","series-title":"WG 2007","first-page":"270","article-title":"Characterization and recognition of digraphs of bounded Kelly-width","volume":"vol. 4769","author":"Meister","year":"2007"},{"key":"10.1016\/j.tcs.2012.06.019_br000060","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.dam.2009.09.018","article-title":"Recognizing digraphs of Kelly-width 2","volume":"158","author":"Meister","year":"2010","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.tcs.2012.06.019_br000065","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":"Journal of Mathematical Analysis and Applications"},{"key":"10.1016\/j.tcs.2012.06.019_br000070","first-page":"176","article-title":"Algorithmic aspects of vertex elimination on directed graphs","volume":"34","author":"Rose","year":"1978","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.tcs.2012.06.019_br000075","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/(SICI)1097-0118(199608)22:4<297::AID-JGT3>3.0.CO;2-G","article-title":"New characterization of digraphs represented by intervals","volume":"22","author":"Sanyal","year":"1996","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/j.tcs.2012.06.019_br000080","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":"Journal of Graph Theory"},{"key":"10.1016\/j.tcs.2012.06.019_br000085","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0012-365X(97)81840-7","article-title":"Short proofs for interval digraphs","volume":"178","author":"West","year":"1998","journal-title":"Discrete Mathematics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512006019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512006019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,22]],"date-time":"2018-11-22T15:24:34Z","timestamp":1542900274000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397512006019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":17,"alternative-id":["S0304397512006019"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2012.06.019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}