{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:34Z","timestamp":1725512014967},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_21","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"208-219","source":"Crossref","is-referenced-by-count":1,"title":["Chordal Graphs as Intersection Graphs of Pseudosegments"],"prefix":"10.1007","author":[{"given":"Cornelia","family":"Dangelmayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Bodirsky, M., Dangelmayr, C., K\u00e1ra, J.: Representing Series-parallel Graphs as Intersection Graphs of Line Segments in Three Directions (submitted)"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.7155\/jgaa.00043","volume":"6","author":"N. Castro de","year":"2002","unstructured":"de Castro, N., Cobos, F.J., Dana, J.C., M\u00e1rquez, A.: Triangle-Free Planar Graphs as Segment Intersection Graphs. Journal of Graph Algorithms and Applications\u00a06, 7\u201326 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"I. Ben-Arroyo Hartman","year":"1991","unstructured":"Ben-Arroyo Hartman, I., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math.\u00a087, 41\u201352 (1991)","journal-title":"Discrete Math."},{"key":"21_CR4","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments. In: Colloquia Mathematica Societatis J\u00e1nos Bolyai, Intuitive Geometry, Szeged, Hungary (1991)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-3-540-31843-9_23","volume-title":"Graph Drawing","author":"H. Fraysseix de","year":"2005","unstructured":"de Fraysseix, H., de Mendez, P.O.: Contact and Intersection Representations. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 217\u2013227. Springer, Heidelberg (2005)"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","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."},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J. Kratochvil","year":"1991","unstructured":"Kratochvil, J.: String Graphs II: Recognizing String Graphs is NP-hard. Journal of Comb. Theory Ser. B\u00a052(1), 67\u201378 (1991)","journal-title":"Journal of Comb. Theory Ser. B"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J. Kratochvil","year":"1994","unstructured":"Kratochvil, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Applied Mathematics\u00a052, 233\u2013252 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochvil","year":"1994","unstructured":"Kratochvil, J., Matou\u0161ek, J.: Intersection graphs of Segments. Journal of Comb. Theory Ser. B\u00a062, 289\u2013315 (1994)","journal-title":"Journal of Comb. Theory Ser. B"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","volume":"41","author":"C. Monma","year":"1986","unstructured":"Monma, C., Wei, V.K.: Intersection graphs of paths in a tree. Journal of Comb. Theory Ser. B\u00a041, 141\u2013181 (1986)","journal-title":"Journal of Comb. Theory Ser. B"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"2","author":"M. Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., Stefanovic, D.: Recognizing string graphs in NP. Journal of Comput. Syst.Sci.\u00a02, 365\u2013380 (2003)","journal-title":"Journal of Comput. Syst.Sci."},{"key":"21_CR12","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs, PhD thesis, Princeton University (1984)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:28Z","timestamp":1605762688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_21","relation":{},"subject":[]}}