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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (1), pp.1-12
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00990425
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mardi 13 mai 2014 - 15:36:14
Dernière modification le : mercredi 29 novembre 2017 - 10:26:18
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:03:30

Fichier

1322-4851-1-PB.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00990425, version 1

Collections

Citation

Therese Biedl, Michal Stern. On edge-intersection graphs of k-bend paths in grids. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (1), pp.1-12. 〈hal-00990425〉

Partager

Métriques

Consultations de la notice

72

Téléchargements de fichiers

136