On edge-intersection graphs of k-bend paths in grids - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

On edge-intersection graphs of k-bend paths in grids

Abstract

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.
Fichier principal
Vignette du fichier
1322-4851-1-PB.pdf (187.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990425 , version 1 (13-05-2014)

Identifiers

Cite

Therese Biedl, Michal Stern. On edge-intersection graphs of k-bend paths in grids. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 1 (1), pp.1-12. ⟨10.46298/dmtcs.482⟩. ⟨hal-00990425⟩

Collections

TDS-MACS
297 View
1010 Download

Altmetric

Share

Gmail Facebook X LinkedIn More