On edge intersection graphs of paths with 2 bends
From MaRDI portal
Recommendations
Cites work
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
- Edge intersection graphs of single bend paths on a grid
- Edge-intersection graphs of grid paths: the bend-number
- scientific article; zbMATH DE number 2084282 (Why is no real title available?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The maximum clique problem in multiple interval graphs
- Unit disk graphs
Cited in
(14)- Edge-intersection graphs of boundary-generated paths in a grid
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- On edge intersection graphs of paths with 2 bends
- Proper circular arc graphs as intersection graphs of paths on a grid
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid
- Edge intersection graphs of \(L\)-shaped paths in grids
- The complexity of Helly-B₁ EPG graph recognition
- Graphs of edge-intersecting and non-splitting one bend paths in a grid
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- Geometric representations of graphs with low polygonal complexity
- CPG graphs: some structural and hardness results
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
This page was built for publication: On edge intersection graphs of paths with 2 bends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181059)