{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:45Z","timestamp":1759063665121},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_11","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T09:05:50Z","timestamp":1384247150000},"page":"115-126","source":"Crossref","is-referenced-by-count":2,"title":["Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations"],"prefix":"10.1007","author":[{"given":"Arman","family":"Boyac\u0131","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T\u0131naz","family":"Ekim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","first-page":"1","volume":"12","author":"T.C. Biedl","year":"2010","unstructured":"Biedl, T.C., Stern, M.: On edge-intersection graphs of k-bend paths in grids. Discrete Mathematics & Theoretical Computer Science\u00a012(1), 1\u201312 (2010)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Boyac\u0131, A., Ekim, T., Shalom, M., Zaks, S.: Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. arXiv:1309.2898 (2013)","DOI":"10.1007\/978-3-642-45043-3_11"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Boyac\u0131, A., Ekim, T., Shalom, M., Zaks, S.: Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part II. arXiv:1309.6471 (2013)","DOI":"10.1007\/978-3-642-45043-3_11"},{"issue":"4","key":"11_CR4","first-page":"433","volume":"3","author":"G. Chartrand","year":"1967","unstructured":"Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l\u2019institut Henri Poincar\u00e9 (B) Probabilit\u00e9s et Statistiques\u00a03(4), 433\u2013438 (1967)","journal-title":"Annales de l\u2019institut Henri Poincar\u00e9 (B) Probabilit\u00e9s et Statistiques"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","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 Mathematics\u00a023(3), 211\u2013227 (1978)","journal-title":"Discrete Mathematics"},{"issue":"5-6","key":"11_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F. Gavril","year":"2000","unstructured":"Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Information Processing Letters\u00a073(5-6), 181\u2013188 (2000)","journal-title":"Information Processing Letters"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"3203","DOI":"10.1016\/j.dam.2008.05.019","volume":"156","author":"M.C. Golumbic","year":"2008","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discrete Appl. Math.\u00a0156, 3203\u20133215 (2008)","journal-title":"Discrete Appl. Math."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.dam.2006.06.019","volume":"156","author":"M.C. Golumbic","year":"2008","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: The k-edge intersection graphs of paths in a tree. Discrete Appl. Math.\u00a0156, 451\u2013461 (2008)","journal-title":"Discrete Appl. Math."},{"key":"11_CR9","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co., Amsterdam (2004)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","volume":"55","author":"M.C. Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: Edge and vertex intersection of paths in a tree. Discrete Mathematics\u00a055(2), 151\u2013159 (1985)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"11_CR11","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(1), 8\u201322 (1985)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"8","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/j.disc.2007.07.064","volume":"308","author":"M.C. Golumbic","year":"2008","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: Representing edge intersection graphs of paths on degree 4 trees. Discrete Mathematics\u00a0308(8), 1381\u20131387 (2008)","journal-title":"Discrete Mathematics"},{"key":"11_CR13","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. J. Graph Theory\u00a062, 369\u2013384 (2009)","journal-title":"J. Graph Theory"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"59","author":"J. Spinrad","year":"1995","unstructured":"Spinrad, J., Sritharan, R.: Algorithms for weakly triangulated graphs. Discrete Applied Mathematics\u00a059(2), 181\u2013191 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Mathematics\u00a055(2), 221\u2013232 (1985)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A New Algorithm for Generating All the Maximal Independent Sets. SIAM Journal on Computing\u00a06(3), 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"}],"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-45043-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T04:37:12Z","timestamp":1578544632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_11"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}