Single bend paths on a grid have strong helly number 4: errata atque emendationes ad “edge intersection graphs of single bend paths on a grid”

DOI10.1002/net.21509zbMath1338.05188OpenAlexW2013017544MaRDI QIDQ2811306

Michal Stern, Marina Lipshteyn, Martin Charles Golumbic

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21509

zbMATH Keywords

intersection graphsstrong Helly number\(B_{1}\)-EPG graphsintersecting paths on a grid

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid ⋮ Hardness and approximation for L-EPG and \(B_1\)-EPG graphs ⋮ Edge-intersection graphs of boundary-generated paths in a grid ⋮ Unnamed Item ⋮ On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

Cites Work

• The edge intersection graphs of paths in a tree
• Edge intersection graphs of single bend paths on a grid
• Vertex Intersection Graphs of Paths on a Grid

This page was built for publication: Single bend paths on a grid have strong helly number 4: errata atque emendationes ad “edge intersection graphs of single bend paths on a grid”