On the 3-tree core of plane graphs (original) (raw)

References

  1. Alam, M.J., Bläsius, T., Rutter, I., Ueckerdt, T., Wolff, A.: Pixel and voxel representations of graphs. In: Giacomo, E.D., Lubiw, A. (eds.) Proceedings of Graph Drawing and Network Visualization. LNCS, vol. 9411, pp. 472–486. Springer, Heidelberg (2015)
  2. Biedl, T.: Height-preserving transformations of planar graph drawings. In: Duncan, C.A., Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing. LNCS, vol. 8871, pp. 380–391. Springer, Heidelberg (2014)
  3. Chrobak, M., Nakano, S.-I.: Minimum-width grid drawings of plane graphs. Computational Geometry 11(1), 29–54 (1998)
    Article MathSciNet Google Scholar
  4. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
    Article MathSciNet Google Scholar
  5. Di Giacomo, E., Didimo, W., Evans, W.S., Liotta, G., Meijer, H., Montecchiani, F., Wismath, S.K.: Ortho-polygon visibility representations of embedded graphs. Algorithmica 80(8), 2345–2383 (2018)
    Article MathSciNet Google Scholar
  6. Dolev, D., Leighton, T., Trickey, H.: Planar embedding of planar graphs. Advances in Computing Research 2, 147–161 (1984)
    Google Scholar
  7. Dujmović, V., Suderman, M., Wood, D.R.: Really straight graph drawings. In: Pach, J. (ed.) Proceedings of the 12th International Symposium on Graph Drawing,. LNCS, vol. 3383, pp. 122–132. Springer, Heidelberg (2004)
  8. Dujmović, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, K., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S.H., Wood, D.: On the parametrized compexity of layered graph drawing. In: Proceedings of European Symposium on Algorithms (ESA). LNCS, vol. 2161, pp. 488–499 (2001)
  9. Durocher, S., Mondal, D.: Drawing planar graphs with reduced height. Journal of Graph Algorithms and Applications 21(4), 433–453 (2017)
    Article MathSciNet Google Scholar
  10. Felsner, S., Knauer, K.B., Mertzios, G.B., Ueckerdt, T.: Intersection graphs of _L_-shapes and segments in the plane. Discret. Appl. Math. 206, 48–55 (2016)
    Article MathSciNet Google Scholar
  11. Jelínek, V., Jelínková, E., Kratochvíl, J., Lidický, B., Tesar, M., Vyskocil, T.: The planar slope number of planar partial 3-trees of bounded degree. Graphs Comb 29(4), 981–1005 (2013)
    Article MathSciNet Google Scholar
  12. Menger, K.: Zur allgemeinen kurventheorie. Fundam. Math. 10(1), 96–115 (1927)
    Article Google Scholar
  13. Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of plane 3-trees. Journal of Graph Algorithms and Applications 15(2), 177–204 (2011)
    Article MathSciNet Google Scholar
  14. Mondal, D., Alam, M.J., Rahman, M.S.: Minimum-layer drawings of trees. In: Proceedings of the 5th International Workshop on Algorithms and Computation. LNCS, vol. 6552, pp. 221–232. Springer, Heidelberg (2011)
  15. Nishat, R.I., Mondal, D., Rahman, M.S.: Visibility drawings of plane 3-trees with minimum area. Math. Comput. Sci. 5(1), 119–132 (2011)
    Article MathSciNet Google Scholar
  16. Mondal, D., Rahman, M.S.: On the 3-tree core of plane graphs. In: Proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation (TAMC). LNCS. Springer, Heidelberg (2024). In Press
  17. Suderman, M.: Proper and planar drawings of graphs on three layers. In: Proceedings of GD. LNCS, vol. 3843, pp. 434–445 (2005)
  18. Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 138–148. ACM, New York, NY, USA (1990)
  19. Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete & Computational Geometry 1, 321–341 (1986)
    Article MathSciNet Google Scholar
  20. Zhang, H., He, X.: Canonical ordering trees and their applications in graph drawing. Discrete & Computational Geometry 33(2), 321–344 (2005)
    Article MathSciNet Google Scholar
  21. Zhang, H., He, X.: Optimal _st_-orientations for plane triangulations. J. Comb. Optim. 17(4), 367–377 (2009)
    Article MathSciNet Google Scholar
  22. Zhang, H., He, X.: Visibility representation of plane graphs via canonical ordering tree. Inf. Process. Lett. 96(2), 41–48 (2005)
    Article MathSciNet Google Scholar

Download references