Skip to main content
Log in

Grid Intersection Graphs and Order Dimension

  • Published:
Order Aims and scope Submit manuscript

Abstract

We study subclasses of grid intersection graphs from the perspective of order dimension. We show that partial orders of height two whose comparability graph is a grid intersection graph have order dimension at most four. Starting from this observation we provide a comprehensive study of classes of graphs between grid intersection graphs and bipartite permutation graphs and the containment relation on these classes. Order dimension plays a role in many arguments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ackerman, E., Barequet, G., Pinter, R.Y.: On the number of rectangulations of a planar point set. J. Comb. Theory Series A 113, 1072–1091 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Adiga, A., Bhowmick, D., Chandran, L.S.: Boxicity and poset dimension. SIAM J. Discret. Math. 25, 1687–1698 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cabello, S., Cardinal, J., Langerman, S.: The clique problem in ray intersection graphs. Discret. Comput. Geom. 50, 771–783 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Catanzaro, D., Chaplick, S., Felsner, S., Halldórsson, B.V., Halldórsson, M.M., Hixon, T., Stacho, J.: Max-point-tolerance graphs. Discret. Appl. Math. 216, 84–97 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chan, T.M., Grant, E.: Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47, 112–124 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chaplick, S., Cohen, E., Morgenstern, G.: Stabbing polygonal chains with rays is hard to approximate. In: Proceedings of the 25th Canadian Conference on Computational Geometry. http://cccg.ca/proceedings/2013/papers/paper_50.pdf (2013)

  7. Chaplick, S., Hell, P., Otachi, Y., Saitoh, T., Uehara, R.: Intersection dimension of bipartite graphs. In: TAMC, vol. 8402 of LNCS, pp. 323–340. Springer, Berlin (2014)

  8. Chepoi, V., Felsner, S.: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. Comput. Geom. 46, 1036–1041 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cobos, F.J., Dana, J.C., Hurtado, F., Márquez, A., Mateos, F.: On a visibility representation of graphs. In: Graph Drawing, vol. 1027, LNCS, pp. 152–161. Springer (1996)

  10. Cogis, O.: On the Ferrers dimension of a digraph. Discret. Math. 38, 47–52 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  11. Correa, J.R., Feuilloley, L., Soto, J.: Independent and hitting sets of rectangles intersecting a diagonal line. In: LATIN, vol. 8392, LNCS, pp. 35–46. Springer (2014)

  12. Dushnik, B., Miller, E.: Partially ordered sets. Am. J. Math. 63, 600–610 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  13. Felsner, S.: Exploiting air-pressure to map floorplans on point sets. J. Graph Alg. Appl. 18, 233–252 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Felsner, S.: The order dimension of planar maps revisited. SIAM J. Discret. Math. 28, 1093–1101 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. Felsner, S., Mustaţă, I., Pergel, M.: The complexity of the partial order dimension problem – closing the gap. SIAM J. Discret. Math. 31, 172–189 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Felsner, S., Nilsson, J.: On the order dimension of outerplanar maps. Order 28, 415–435 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Felsner, S., Trotter, W.T.: Posets and planar graphs. J. Graph Theory 49, 273–284 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Halldȯrsson, B.V., Aguiar, D., Tarpine, R., Istrail, S.: The clark phaseable sample size problem: Long-range phasing and loss of heterozygosity in GWAS. J. Comput. Biol. 18, 323–333 (2011)

    Article  MathSciNet  Google Scholar 

  19. Hixon, T.: Hook graphs and more: some contributions to geometric graph theory, masters thesis TU Berlin (2013)

  20. Hoffmann, U.: Intersection Graphs and Geometric Objects in the Plane. PhD thesis, TU Berlin (2016)

    Google Scholar 

  21. Katz, M.J., Mitchell, J.S., Nir, Y.: Orthogonal segment stabbing. Comput. Geom. 30, 197–205 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kostochka, A.V., Neṡetṙil, J.: Coloring relatives of intervals on the plane, i: chromatic number versus girth. Eur. J. Comb. 19, 103–110 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  23. Kratochvíl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discret. Appl. Math. 52, 233–252 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  24. Mustaţă, I., Pergel, M.: Unit grid intersection graphs: Recognition and properties. arXiv:1306.1855 (2013)

  25. Schnyder, W.: Planar graphs and poset dimension. Order 5, 323–343 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  26. Shrestha, A.M.S., Takaoka, A., Satoshi, T.: On two problems of nano-PLA design. IEICE Trans. Inf. Syst. 94, 35–41 (2011)

    Article  Google Scholar 

  27. Shrestha, A.M.S., Tayu, S., Ueno, S.: On orthogonal ray graphs. Discret. Appl. Math. 158, 1650–1659 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  28. Sinden, F.W.: Topology of thin film RC circuits. Bell Syst. Tech. J. 45, 1639–1662 (1966)

    Article  MATH  Google Scholar 

  29. Soto, M., Thraves, C.: p-box: A new graph model. Discret. Math. Theor. Comput. Sci. 17, 18 (2015)

    MathSciNet  MATH  Google Scholar 

  30. Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discret. Comput. Geom. 1, 321–341 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  31. Telha, C., Soto, J.: Jump number of two-directional orthogonal ray graphs. In: IPCO, vol. 6655, LNCS, pp. 389–403. Springer (2011)

  32. Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory, Johns Hopkins Series in the Mathematical Sciences. The Johns Hopkins University Press, Baltimore (1992)

  33. Trotter, W.T. Jr., Moore, J.I. Jr., Sumner, D.P.: The dimension of a comparability graph. Proc. Amer. Math. Soc. 60(1976), 35–38 (1977)

    MathSciNet  MATH  Google Scholar 

  34. Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proceedings of the annual symposium on computational geometry, pp. 147–152. ACM (1985)

Download references

Acknowledgements

We like to thank the reviewers for useful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Udo Hoffmann.

Additional information

Steven Chaplick is supported by ESF EuroGIGA project GraDR, Stefan Felsner is partially supported by DFG grant FE-340/7-2 and ESF EuroGIGA project GraDR, Udo Hoffmann and Veit Wiechert are supported by the Deutsche Forschungsgemeinschaft within the research training group ’Methods for Discrete Structures’ (GRK 1408). The paper is a part of the third author’s dissertation [20].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chaplick, S., Felsner, S., Hoffmann, U. et al. Grid Intersection Graphs and Order Dimension. Order 35, 363–391 (2018). https://doi.org/10.1007/s11083-017-9437-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-017-9437-0

Keywords

Navigation