Skip to main content
Log in

Combinatorial Characterization of Upward Planarity

  • Published:
Communications in Mathematics and Statistics Aims and scope Submit manuscript

Abstract

We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Bertolazzi, G., Di Battista, G.: On upward drawings of triconnected digraphs. In: Proceedings of the 7th Annual Symposium on Computational Geometry, pp. 272–280 (1991)

  2. Bertolazzi, G., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12, 476–497 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61(2–3), 175–198 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fáry, I.: On straight line representation of planar graphs. Acta. Univ. Szeged. Sect. Sci. Math. 11, 229–233 (1948)

    MathSciNet  MATH  Google Scholar 

  5. Garg, A., Tamassia, R.: Upward planarity testing. Order 12(2), 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hu, S., Lu, X., Ye, Y.: A graphical calculus for semi-groupal categories. Appl. Categ. Struct. arXiv:1604.07276 (to appear)

  7. Joyal, A., Street, R.: The geometry of tensor calculus. I. Adv. Math. 88(1), 55–112 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kelly, D.: Fundamentals of planar ordered sets. Discrete Math. 63(2), 197–216 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  9. Rival, I.: Reading, drawing, and order. In: Rosenberg, I.G., Sabidussi, G. (eds.) Algebras and Orders, NATO ASI Series (Series C: Mathematical and Physical Sciences), vol. 389, pp. 359–404. Springer, Dordrecht (1993)

    Google Scholar 

  10. Trotter, W.T.: Order preserving embeddings of aographs. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 572–579. Springer, Berlin (1978)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Wagner, K.: Bemerkung zum Vierfarbenproblem. Jber. Deutsch. Math. Verein. 46, 26–32 (1936)

    MATH  Google Scholar 

Download references

Acknowledgements

This work is partly supported by the National Scientific Foundation of China Nos. 11431010 and 11571329 and “the Fundamental Research Funds for the Central Universities.”

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuexing Lu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lu, X., Ye, Y. Combinatorial Characterization of Upward Planarity. Commun. Math. Stat. 7, 207–223 (2019). https://doi.org/10.1007/s40304-018-0169-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40304-018-0169-2

Keywords

Mathematics Subject Classification

Navigation