On Edge Intersection Graphs of Paths with 2 Bends

  • Martin Pergel
  • Paweł RzążewskiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9941)


An EPG-representation of a graph G is a collection of paths in a grid, each corresponding to a single vertex of G, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In this paper we focus on graphs admitting EPG-representations by paths with at most 2 bends. We show hardness of the recognition problem for this class of graphs, along with some subclasses.

We also initiate the study of graphs representable by unaligned polylines, and by polylines, whose every segment is parallel to one of prescribed slopes. We show hardness of recognition and explore the trade-off between the number of bends and the number of slopes.


  1. 1.
    Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–389 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Černý, J., Král, D., Nyklová, H., Pangrác, O.: On intersection graphs of segments with prescribed slopes. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 261–271. Springer, Heidelberg (2002). doi: 10.1007/3-540-45848-4_21 CrossRefGoogle Scholar
  3. 3.
    Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Disc. Math. 86, 165–177 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cameron, K., Chaplick, S., Hoang, C.T.: Edge intersection graphs of \(L\)-shaped paths in grids. Disc. Appl. Math. (2015, in press, available online)Google Scholar
  5. 5.
    Chaplick, S., Jelínek, V., Kratochvíl, J., Vyskočil, T.: Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 274–285. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  6. 6.
    Francis, M., Gonçalves, D., Ochem, P.: The maximum clique problem in multiple interval graphs. Algoritmica 71, 812–836 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Golumbic, M., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. Networks 54, 130–138 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: the bend-number. Disc. Appl. Math. 167, 144–162 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Lovász, L: Coverings and coloring of hypergraphs. In: Proceedings of the 4th SEICCGTC, pp. 3–12 (1973)Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2016

Authors and Affiliations

  1. 1.Department of Software and Computer Science EducationCharles UniversityPrahaCzech Republic
  2. 2.Institute of Computer Science and ControlHungarian Academy of Sciences (MTA SZTAKI)BudapestHungary
  3. 3.Faculty of Mathematics and Information ScienceWarsaw University of TechnologyWarszawaPoland

Personalised recommendations