On edge-intersection graphs of k-bend paths in grids
From MaRDI portal
Publication:3575465
zbMATH Open1250.05077MaRDI QIDQ3575465FDOQ3575465
Authors: Michal Stern, Therese Biedl 
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1322/0.html
Recommendations
- Edge-Intersection Graphs of k-Bend Paths in Grids
- Edge-intersection graphs of grid paths: the bend-number
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid
- scientific article; zbMATH DE number 7272507
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (19)
- CPG graphs: some structural and hardness results
- Edge-intersection graphs of boundary-generated paths in a grid
- Graphs of edge-intersecting and non-splitting paths
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid
- Some properties of edge intersection graphs of single-bend paths on a grid
- On edge intersection graphs of paths with 2 bends
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
- Vertex intersection graphs of paths on a grid: characterization within block graphs
- Characterizations of cographs as intersection graphs of paths on a grid
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- On the bend-number of planar and outerplanar graphs
- On the bend number of circular-arc 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
- Edge-intersection graphs of grid paths: the bend-number
- Title not available (Why is that?)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- Edge-Intersection Graphs of k-Bend Paths in Grids
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
This page was built for publication: On edge-intersection graphs of \(k\)-bend paths in grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575465)
