Edge-Intersection Graphs of k-Bend Paths in Grids

DOI10.1007/978-3-642-02882-3_10zbMath1248.68368OpenAlexW1525815275MaRDI QIDQ5323053

Michal Stern, Therese C. Biedl

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid ⋮ 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 systems of paths on a grid with a bounded number of bends

Cites Work

• Unnamed Item
• Edge intersection graphs of systems of paths on a grid with a bounded number of bends
• Planar graphs: Theory and algorithms
• Algorithmic graph theory and perfect graphs
• The \(k\)-edge intersection graphs of paths in a tree
• Edge intersection graphs of single bend paths on a grid
• On Triangle Contact Graphs