Abstract
The authors give an upper bound for the projective plane crossing number of a circular graph. Also, the authors prove the projective plane crossing numbers of circular graph C(8,3) and C(9,3) are 2 and 1, respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. J. Ma, H. Ren, and J. J. Lu, The crossing number of the circular graph C(2m + 2, m), Discrete Mathematics, 2005, 304(1–3): 88–93.
X. H. Lin, Y. S. Yang, J. G. Lü, and X. Hao, The crossing number of C(mk;{1,k}), Graphs and Combinatorics, 2005, 21(1): 89–96.
J. J. Lu, H. Ren, and D. J. Ma, The crossing number of C(m, 3), J. Sys. Sci. & Math. Sci., 2006, 26(4): 504–512.
T. Y. Liu and Y. P. Liu, On The Crossing Number Of Circular Graph, Operation Research Transactions, 1998, 2(3): 32–38.
R. X. Hao and Y. P. Liu, New Upper Bounds On Crossing Number Of Circular Graph, Operation Research Transactions, 1999, 3(3): 1–6.
J. A. Bondy and U. S. R. Murty, Graph Theory with Application, Macmillan, London, Elsevier, New York, 1979.
B. Mohar and C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, 2001.
D. Archdeacon, A Kuratowski Theorem for the Projective Plane, Ph. D. Thesis, The Ohio State University, Ohio, 1980.
H. H. Glover, J. P. Huneke, and C. S. Wang, 103 graphs that are irreducible for the projective plane, J. Combin. Theory Ser.B, 1979, 27(B): 332–370.
Author information
Authors and Affiliations
Corresponding author
Additional information
*This research is supported by the National Natural Science Foundation of China under Grant No. 10671073, Scientific Study Foundation of the Talented People Gathered by Nantong University, partially by Science and Technology Commission of Shanghai Municipality under Grant No. 07XD14011, Shanghai Leading Academic Discipline Project under Grant No. B407, and Natural Science Foundation of Jiangsu’s Universities under Grant No. 07KJB110090.
Rights and permissions
About this article
Cite this article
MA, D., REN, H. The projective plane crossing numbers of circular graphs*. J Syst Sci Complex 21, 316–322 (2008). https://doi.org/10.1007/s11424-008-9115-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-008-9115-9