10.46298/dmtcs.482
https://dmtcs.episciences.org/482
Biedl, Therese
Therese
Biedl
Stern, Michal
Michal
Stern
Natural Sciences and Engineering Research Council of Canada
On edge-intersection graphs of k-bend paths in grids
Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are paths in a grid and edges between vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications in conflict resolution of paths in grid networks. In this paper, we continue the study of edge-intersection graphs of paths in a grid, which was initiated by Golumbic, Lipshteyn and Stern. We show that for any k, if the number of bends in each path is restricted to be at most k, then not all graphs can be represented. Then we study some graph classes that can be represented with k-bend paths, for small k. We show that every planar graph has a representation with 5-bend paths, every outerplanar graph has a representation with 3-bend paths, and every planar bipartite graph has a representation with 2-bend paths. We also study line graphs, graphs of bounded pathwidth, and graphs with -regular edge orientations.
episciences.org
Intersection graphs
planar graphs
graph drawing
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2010-01-01
2010-01-01
en
journal article
https://hal.science/hal-00990425v1
1365-8050
https://dmtcs.episciences.org/482/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 12 no. 1
Researchers
Students