Skip to main content
Log in

Additivity of the crossing number of graphs with connectivity 2

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

We prove that the crossing number of graphs with connectivity 2 has in certain cases an additive property analogous to that of crossing number of graphs with connectivity ≤1.

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. R. W. Decker, H. H. Glover, J. P. Huneke, The genus of the 2-amalgamations of graphs,J. Graph Theory 5 (1981), 95–102.MR 82d: 05056

    Article  MathSciNet  MATH  Google Scholar 

  2. F. Harary,Graph theory, Addison-Wesley, Reading, Mass., 1969.MR 41 # 1566

    MATH  Google Scholar 

  3. P. C. Kainen, A. T. White, On stable crossing numbers,J. Graph Theory 2 (1978), 181–187,MR 58 #10549

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Širáň, J. Additivity of the crossing number of graphs with connectivity 2. Period Math Hung 15, 301–305 (1984). https://doi.org/10.1007/BF02454162

Download citation

  • Received:

  • Published:

  • Issue Date:

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

AMS (MOS) subject classification (1980)

Key words and phrases

Navigation