{"docId":482,"paperId":482,"url":"https:\/\/dmtcs.episciences.org\/482","doi":"10.46298\/dmtcs.482","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":88,"name":"Vol. 12 no. 1"}],"section":[],"repositoryName":"Hal","repositoryIdentifier":"hal-00990425","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00990425v1","dateSubmitted":"2015-03-26 16:20:46","dateAccepted":"2015-06-09 14:47:26","datePublished":"2010-01-01 08:00:00","titles":{"en":"On edge-intersection graphs of k-bend paths in grids"},"authors":["Biedl, Therese","Stern, Michal"],"abstracts":{"en":"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."},"keywords":[["Intersection graphs"],["planar graphs"],["graph drawing"],"[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}