Graphs of edge-intersecting and non-splitting paths
From MaRDI portal
Publication:288788
DOI10.1016/J.TCS.2015.10.004zbMATH Open1339.05410OpenAlexW2207357184MaRDI QIDQ288788FDOQ288788
Authors: Arman Boyacı, Tınaz Ekim, Mordechai Shalom, Shmuel Zaks
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
Recommendations
- Graphs of edge-intersecting and non-splitting one bend paths in a grid
- Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- Edge intersection graphs of single bend paths on a grid
Cites Work
- Edge and vertex intersection of paths in a tree
- Decomposition by clique separators
- Representing edge intersection graphs of paths on degree 4 trees
- The edge intersection graphs of paths in a tree
- Edge-intersection graphs of grid paths: the bend-number
- Edge intersection graphs of single bend paths on a grid
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- The \(k\)-edge intersection graphs of paths in a tree
- Graphs of edge-intersecting and non-splitting paths
- Title not available (Why is that?)
- On edge-intersection graphs of \(k\)-bend paths in grids
- Characterizing circular-arc graphs
- General theoretical results on rectilinear embeddability of graphs
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
Cited In (11)
- Paths through K-specified edges in a linear graph
- Graphs of edge-intersecting and non-splitting one bend paths in a grid
- Title not available (Why is that?)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II
- Graphs of edge-intersecting and non-splitting paths
- Edge-pancyclic block-intersection graphs
- Intersection graphs of non-crossing paths
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- Non-shared edges and nearest neighbor interchanges revisited
- The maximum cardinality cut problem in co-bipartite chain graphs
- Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract)
This page was built for publication: Graphs of edge-intersecting and non-splitting paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288788)