Author:
Boyacı Arman,Ekim Tınaz,Shalom Mordechai,Zaks Shmuel
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Biedl, T.C., Stern, M.: On edge-intersection graphs of k-bend paths in grids. Discrete Mathematics & Theoretical Computer Science 12(1), 1–12 (2010)
2. Boyacı, 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)
3. Boyacı, 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)
4. Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l’institut Henri Poincaré (B) Probabilités et Statistiques 3(4), 433–438 (1967)
5. Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discrete Mathematics 23(3), 211–227 (1978)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献