Graphs of edge-intersecting and non-splitting paths
|Başlık||Graphs of edge-intersecting and non-splitting paths|
|Publication Type||Journal Article|
|Year of Publication||2016|
|Authors||Boyacı, A., T. Ekim, M. Shalom, and S. Zaks|
|Journal||Theoretical Computer Science|
|Anahtar kelimeler||EPG graphs, EPT graphs, Intersection graphs|
The families of Edge Intersection Graphs of Paths in a tree (resp. in a grid) EPT (resp. EPG) are well studied graph classes. Recently we introduced the class of graphs of Edge-Intersecting and Non-Splitting Paths in a Tree (ENPT) . In this model, two vertices are adjacent if they represent two intersecting paths of a tree whose union is also a path. In this study we generalize this graph class by allowing the host graph to be an arbitrary graph. These are the graphs of Edge-Intersecting and Non-Splitting Paths ENP. Although the Edge Intersection Graphs of Paths in an arbitrary graph includes all graphs, we show that this is not the case for ENP. We also show that the class ENP coincides with the family of graphs of Edge-Intersecting and Non-Splitting Paths in a Grid (ENPG). Following similar studies for EPG graph class, we study the implications of restricting the number of bends of the individual paths in the grid. We show that such a restriction restricts the graph class. Specifically, by restricting the number of bends one gets an infinite sequence of classes such that every class is properly included in the next one.