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.
Similar content being viewed by others
References
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
F. Harary,Graph theory, Addison-Wesley, Reading, Mass., 1969.MR 41 # 1566
P. C. Kainen, A. T. White, On stable crossing numbers,J. Graph Theory 2 (1978), 181–187,MR 58 #10549
Author information
Authors and Affiliations
Rights 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
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02454162