Graphs of edge-intersecting and non-splitting paths
From MaRDI portal
Publication:288788
DOI10.1016/j.tcs.2015.10.004zbMath1339.05410OpenAlexW2207357184MaRDI QIDQ288788
Mordechai Shalom, Shmuel Zaks, Tınaz Ekim, Arman Boyacı
Publication date: 27 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.004
Related Items (2)
Graphs of edge-intersecting and non-splitting paths ⋮ The maximum cardinality cut problem in co-bipartite chain graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Graphs of edge-intersecting and non-splitting paths
- The edge intersection graphs of paths in a tree
- General theoretical results on rectilinear embeddability of graphs
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Edge and vertex intersection of paths in a tree
- Decomposition by clique separators
- Edge-intersection graphs of grid paths: the bend-number
- The \(k\)-edge intersection graphs of paths in a tree
- Representing edge intersection graphs of paths on degree 4 trees
- Edge intersection graphs of single bend paths on a grid
- Characterizing circular-arc graphs
This page was built for publication: Graphs of edge-intersecting and non-splitting paths
