{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:18:23Z","timestamp":1726409903368},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_24","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"273-284","source":"Crossref","is-referenced-by-count":0,"title":["Chordal Digraphs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Meister","sequence":"first","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Digraphs. Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs. Theory, Algorithms and Applications. Springer, Heidelberg (2000)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A Characterisation of Rigid Circuit Graphs. Discrete Mathematics\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Mathematics"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\u00a025, 71\u201376 (1961)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The Intersection Graphs of Subtrees in Trees Are Exactly the Chordal Graphs. Journal of Combinatorial Theory (B)\u00a016, 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"24_CR5","first-page":"739","volume":"23","author":"F. Harary","year":"1982","unstructured":"Harary, F., Kabell, J.A., McMorris, F.R.: Bipartite intersection graphs. Commentationes Mathematicae Universitatis Carolinae\u00a023, 739\u2013745 (1982)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/0202018","volume":"2","author":"L. Haskins","year":"1973","unstructured":"Haskins, L., Rose, D.J.: Toward characterization of perfect elimination digraphs. SIAM Journal on Computing\u00a02, 217\u2013224 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.tcs.2008.02.038","volume":"399","author":"P. Hunter","year":"2008","unstructured":"Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. Theoretical Computer Science\u00a0399, 206\u2013219 (2008)","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/0203022","volume":"3","author":"D.J. Kleitman","year":"1974","unstructured":"Kleitman, D.J.: A note on perfect elimination digraphs. SIAM Journal on Computing\u00a03, 280\u2013282 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-74839-7_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Meister","year":"2007","unstructured":"Meister, D., Telle, J.A., Vatshelle, M.: Characterization and Recognition of Digraphs of Bounded Kelly-width. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 270\u2013279. Springer, Heidelberg (2007)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D.J. Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated Graphs and the Elimination Process. Journal of Mathematical Analysis and Applications\u00a032, 597\u2013609 (1970)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1137\/0134014","volume":"34","author":"D.J. Rose","year":"1978","unstructured":"Rose, D.J., Tarjan, R.E.: Algorithmic Aspects of Vertex Elimination on Directed Graphs. SIAM Journal on Applied Mathematics\u00a034, 176\u2013197 (1978)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1097-0118(199608)22:4<297::AID-JGT3>3.0.CO;2-G","volume":"22","author":"B.K. Sanyal","year":"1996","unstructured":"Sanyal, B.K., Sen, M.K.: New characterization of digraphs represented by intervals. Journal of Graph Theory\u00a022, 297\u2013303 (1996)","journal-title":"Journal of Graph Theory"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/jgt.3190020311","volume":"2","author":"J.R. Walter","year":"1978","unstructured":"Walter, J.R.: Representations of Chordal Graphs as Subtrees of a Tree. Journal of Graph Theory\u00a02, 265\u2013267 (1978)","journal-title":"Journal of Graph Theory"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0012-365X(97)81840-7","volume":"178","author":"D.B. West","year":"1998","unstructured":"West, D.B.: Short proofs for interval digraphs. Discrete Mathematics\u00a0178, 287\u2013292 (1998)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:03Z","timestamp":1619783523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}