Edge-Intersection Graphs of k-Bend Paths in Grids

  • Therese Biedl
  • Michal Stern
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5609)

Abstract

Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the 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 bipartite planar graph has a representation with 2-bend paths.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asinowski, A., Suk, A.: Edge intersection graphs of systems of grid paths with bounded number of bends. Discrete Applied Mathematics (accepted), preliminary version available at, http://www.technion.ac.il/~andrei/epg.pdf
  2. 2.
    de Fraysseix, H., Ossona de Mendez, P.: Regular orientations, arboricity and augmentation. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 111–118. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  3. 3.
    de Fraysseix, H., Ossona de Mendez, P., Pach, J.: Representation of planar graphs by segments. Intuitive Geometry 63, 109–117 (1991)MathSciNetMATHGoogle Scholar
  4. 4.
    de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing 3, 233–246 (1994)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 2nd edn. Academic Press, New York (2004)MATHGoogle Scholar
  6. 6.
    Golumbic, M.C., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. In: Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW 2007), University of Twente, pp. 53–55 (2007)Google Scholar
  7. 7.
    Golumbic, M.C., Lipshteyn, M., Stern, M.: The k-edge intersection graphs of paths in a tree. Discrete Appl. Math. 156(4), 451–461 (2008)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. North-Holland, Amsterdam (1988)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Therese Biedl
    • 1
  • Michal Stern
    • 2
  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterloo, OntarioCanada
  2. 2.Caesarea Rothschild InstituteUniversity of Haifa, Israel, and The Academic College of Tel-AvivYaffoIsrael

Personalised recommendations