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.21509MaRDI QIDQ2811306zbMATH OpenOpenAlexFDO

Authors Marina Lipshteyn, Michal Stern, 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

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

Recommendations

• Edge intersection graphs of single bend paths on a grid
• Edge-intersection graphs of grid paths: the bend-number
• Some properties of edge intersection graphs of single bend paths on a grid
• Some properties of edge intersection graphs of single-bend paths on a grid
• Edge-Intersection Graphs of k-Bend Paths in Grids

Cites work

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

Cited in

(5)

• Edge-intersection graphs of boundary-generated paths in a grid
• 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
• The complexity of Helly-\(B_1\) EPG graph recognition
• Hardness and approximation for L-EPG and \(B_1\)-EPG graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811306)