{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:07:46Z","timestamp":1742911666523,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_24","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"256-265","source":"Crossref","is-referenced-by-count":2,"title":["From Path Graphs to Directed Path Graphs"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"given":"Marisa","family":"Gutierrez","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"L\u00e9v\u00eaque","sequence":"additional","affiliation":[]},{"given":"Silvia B.","family":"Tondato","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Chaplick, S.: PQR-trees and undirected path graphs, M.Sc.\u00a0Thesis, Dept. of Computer Science, University of Toronto, Canada (2008)"},{"key":"24_CR2","first-page":"201","volume-title":"5th Italian Conference on Theoretical Computer Science (Revello, 1995)","author":"E. Dahlhaus","year":"1996","unstructured":"Dahlhaus, E., Bailey, G.: Recognition of path graphs in linear time. In: 5th Italian Conference on Theoretical Computer Science (Revello, 1995), pp. 201\u2013210. World Sci., Publishing, River Edge (1996)"},{"key":"24_CR3","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. J. Combin. Theory B\u00a016, 47\u201356 (1974)","journal-title":"J. Combin. Theory B"},{"key":"24_CR4","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":"24_CR5","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Annals Disc. Math.\u00a057 (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015, 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/jgt.20407","volume":"62","author":"B. L\u00e9v\u00eaque","year":"2009","unstructured":"L\u00e9v\u00eaque, B., Maffray, F., Preissmann, M.: Characterizing path graphs by forbidden induced subgraphs. Journal of Graph Theory\u00a062, 369\u2013384 (2009)","journal-title":"Journal of Graph Theory"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","volume":"41","author":"C.L. Monma","year":"1986","unstructured":"Monma, C.L., Wei, V.K.: Intersection graphs of paths in a tree. Journal of Combinatorial Theory B\u00a041, 141\u2013181 (1986)","journal-title":"Journal of Combinatorial Theory B"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(98)00127-7","volume":"196","author":"B.S. Panda","year":"1999","unstructured":"Panda, B.S.: The forbidden subgraph characterization of directed vertex graphs. Discrete Mathematics\u00a0196, 239\u2013256 (1999)","journal-title":"Discrete Mathematics"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(93)90116-6","volume":"43","author":"A.A. Sch\u00e4ffer","year":"1993","unstructured":"Sch\u00e4ffer, A.A.: A faster algorithm to recognize undirected path graphs. Discrete Appl. Math.\u00a043, 261\u2013295 (1993)","journal-title":"Discrete Appl. Math."},{"key":"24_CR12","unstructured":"Tondato, S.B.: Grafos Cordales: \u00c1rboles clique y Representaciones can\u00f3nicas, Doctoral Thesis, Universidad Nacional de La Plata, Argentina (2009) (in spanish)"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:13:02Z","timestamp":1558293182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}