{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:41:55Z","timestamp":1725522115729},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922476"},{"type":"electronic","value":"9783540922483"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92248-3_25","type":"book-chapter","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T13:36:17Z","timestamp":1228397777000},"page":"275-286","source":"Crossref","is-referenced-by-count":2,"title":["What Is between Chordal and Weakly Chordal Graphs?"],"prefix":"10.1007","author":[{"given":"Elad","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin Charles","family":"Golumbic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Lipshteyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Stern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","first-page":"164","volume":"7","author":"A. Berry","year":"2000","unstructured":"Berry, A., Bordat, J., Heggernes, P.: Recognizing weakly triangulated graphs by edge separability. Nordic Journal of Computing\u00a07(3), 164 (Fall, 2000)","journal-title":"Nordic Journal of Computing"},{"key":"25_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":"25_CR3","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 Combinatorics\u00a05, 339\u2013349 (1989)","journal-title":"Graphs and Combinatorics"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B, 47\u201356 (1974)","DOI":"10.1016\/0095-8956(74)90094-X"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(78)90070-5","volume":"23","author":"F. Gavril","year":"1978","unstructured":"Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discrete Math.\u00a023, 211\u2013227 (1978)","journal-title":"Discrete Math."},{"key":"25_CR6","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":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11917496_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Golumbic","year":"2006","unstructured":"Golumbic, M., Lipshteyn, M., Stern, M.: Finding intersection models of weakly chordal graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 241\u2013255. Springer, Heidelberg (2006)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Golumbic, M., Lipshteyn, M., Stern, M.: Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discrete Applied Mathematics (to appear)","DOI":"10.1016\/j.dam.2008.05.019"},{"key":"25_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"M. Golumbic","year":"2004","unstructured":"Golumbic, M., Trenk, A.: Tolerance Graphs, Ch.\u00a011. Cambridge Univ. Press, Cambridge (2004)"},{"key":"25_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":"25_CR11","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 Mathematics\u00a0290, 27\u201346 (2005)","journal-title":"Discrete Mathematics"},{"key":"25_CR12","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 Mathematics\u00a0215, 115\u2013131 (2000)","journal-title":"Discrete Mathematics"},{"key":"25_CR13","unstructured":"Walter, J.R.: Representations of rigid cycle graphs, Ph.D. 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\/978-3-540-92248-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T08:30:31Z","timestamp":1551688231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92248-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922476","9783540922483"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92248-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}