{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:39:00Z","timestamp":1725471540264},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_22","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T06:16:13Z","timestamp":1161152173000},"page":"241-255","source":"Crossref","is-referenced-by-count":6,"title":["Finding Intersection Models of Weakly Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Martin Charles","family":"Golumbic","sequence":"first","affiliation":[]},{"given":"Marina","family":"Lipshteyn","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)"},{"key":"22_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 characterization of rigid circuit graphs. Discrete Math.\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Math."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser.\u00a0B, 47\u201356 (1974)","DOI":"10.1016\/0095-8956(74)90094-X"},{"key":"22_CR4","volume-title":"Annals of Discrete Math.","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. In: Annals of Discrete Math., 2nd edn., vol.\u00a057. Elsevier, Amsterdam (2004)","edition":"2"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"38","author":"M.C. Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. Journal of Combinatorial Theory, Series B\u00a038, 8\u201322 (1985)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs, ch. 11","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs, ch. 11. Cambridge University Press, Cambridge (2004)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01788689","volume":"5","author":"R.B. Hayward","year":"1989","unstructured":"Hayward, R.B., Ho\u00e0ng, C.T., Maffray, F.: Optimizing weakly triangulated graphs. Graphs and Combinatorcs\u00a05, 339\u2013349 (1989)","journal-title":"Graphs and Combinatorcs"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(99)00231-9","volume":"215","author":"R.E. Jamison","year":"2000","unstructured":"Jamison, R.E., Mulder, H.M.: Tolerance intersection graphs on binary trees with constant tolerance 3. Discrete Math.\u00a0215, 115\u2013131 (2000)","journal-title":"Discrete Math."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.disc.2004.04.017","volume":"290","author":"R.E. Jamison","year":"2005","unstructured":"Jamison, R.E., Mulder, H.M.: Constant tolerance intersection graphs of subtrees of a tree. Discrete Math.\u00a0290, 27\u201346 (2005)","journal-title":"Discrete Math."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01788142","volume":"7","author":"F.R. McMorris","year":"1991","unstructured":"McMorris, F.R., Scheinerman, E.: Connectivity threshold for random chordal graphs. Graphs and Combin.\u00a07, 177\u2013181 (1991)","journal-title":"Graphs and Combin."},{"key":"22_CR11","volume-title":"Efficient Graph Representations","author":"J. Spinrad","year":"2003","unstructured":"Spinrad, J.: Efficient Graph Representations. American Mathematical Society, Providence (2003)"},{"key":"22_CR12","unstructured":"Walter, J.R.: Representations of rigid cycle graphs, PhD Thesis, Wayne State Univ. (1972)"}],"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\/11917496_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:33Z","timestamp":1605643113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11917496_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}