Skip to main content
SpringerLink
Log in

On boolean characterizations of planarity and planar embeddings of graphs

  • Methodology
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper is basically a survey on the Boolean characterizations of planarity and planar embeddings of graphs with some new results. A decomposition of a non-planar graph into a kind of maximal planar subgraphs is also provided.

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

Access this article

Log in via an institution

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. L. Auslander and S.V. Parter, On embedding graphs in a sphere, J. Math. Mech. 10(1961)517–523.

    Google Scholar 

  2. H. Fraysseix and P. Rosenstiehl, A depth-first-search characterization of planarity, Ann. Discr. Math. 13(1982)75–80.

    Google Scholar 

  3. P.L. Hammer and S. Rudeanu,Boolean Methods in Operations Research and Related Areas (Springer, 1968).

  4. L. Hopcroft and R.E. Tarjan, Efficient planarity testing, J. ACM 21(1974)549–568.

    Google Scholar 

  5. K. Kuratowski, Sur le problême des courbes gauches en topologie, Fund. Math. 15(1930)271–283.

    Google Scholar 

  6. Y. Liu, Modulo 2 programming and planar embeddings. Acta Math. Appl. Sinica 1(1978)321–329, in Chinese.

    Google Scholar 

  7. Y. Liu, On the lienarity of testing planarity of graphs, Chin. Ann. Math. 7B(1986)425–434.

    Google Scholar 

  8. Y. Liu, Planarity testing and planar embeddings of graphs, Acta Math. Appl. Sinica 2(1979)350–365, in Chinese.

    Google Scholar 

  9. Y. Liu, A new approach to the linearity of testing planarity of graphs, Acta Math. Appl. Sinica (English Series) 4(1988).

  10. Y. Liu, Boolean planarity characterization of graphs, RUTCOR Research Report, Rutgers University (1987); also in Acta Math. sinica, New Series 4(1988)316–329.

  11. Y. Liu, Boolean approach to planar embeddings of graphs, RUTCOR Research Report, Rutgers University (1987); also in Acta Math. Sinica, New Series 5(1989)64–79.

  12. S. Maclane, A structural characterization of planar combinatorial graphs, Duke Math. J. 3(1937)460–472.

    Google Scholar 

  13. S. Maclane, A combinatorial condition for planar graphs, Fund. Math. 28(1937)22–32.

    Google Scholar 

  14. P. Rosenstiehl, Preuve algebrique du critère de planarité du Wu-Liu, Ann. Discr. Math. 9(1980)67–78.

    Google Scholar 

  15. W.T. Tutte, Toward a theory of crossing numbers, J. Comb. Theory 8(1970)45–53.

    Google Scholar 

  16. H. Whitney, Non-separable and planar graphs, Trans. AMS 34(1932)339–362.

    Google Scholar 

  17. H. Whitney, Planar graphs, Fund. Math. 21(1933)73–84.

    Google Scholar 

  18. W. Wu, On the realization of complexes in Euclidean space, Acta Math. Sinica 5(1955)505–552, in Chinese.

    Google Scholar 

  19. W. Wu, Planar embeddings of linear graphs, Kexue Tongbao 19(1974)226–228, in Chinese.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Institute of Mathematics, Academia Sinica, 10080, Beijing, P.R. China

    Yanpei Liu

Authors
  1. Yanpei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor Peter L. Hammer on the occasion of his fiftieth birthday

This research was partially supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Y. On boolean characterizations of planarity and planar embeddings of graphs. Ann Oper Res 24, 165–174 (1990). https://doi.org/10.1007/BF02216821

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02216821

Keywords

Search

Navigation