Abstract
There are known crossing numbers of Cartesian products of stars with all graphs of order at most four. In this paper we are dealing with the Cartesian products of stars with graphs on five vertices. We give the exact values of crossing numbers for some of these graphs and we summarise all known results concerning crossing numbers of these graphs. In addition, we give the crossing number of the join product of star and the cycle C 5 with one additional edge.
The research was supported by the Slovak VEGA grant No. 1/0636/08.
This work was supported by the Slovak Research and Development Agency under the contract No. APVV-0073-07.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Beineke, L.W., Ringeisen, R.D.: On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory 4, 145–155 (1980)
Bokal, D.: On the crossing numbers of Cartesian products with paths. J. Combin. Theory B 97, 381–384 (2007)
Bokal, D.: On the crossing numbers of Cartesian products with trees. J. Graph Theory 56, 287–300 (2007)
Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic and Discrete Methods 4, 312–316 (1983)
He, P., Huang, Y.: The crossing number of W 4 ×S n . Journal of Zhengzhou University (Natural Science Edition) 39, 14–18 (2007)
Ho, P.T.: The crossing number of K 1,1,3,n . Ars Combinatoria (to appear)
Huang, Y., Zhao, T.: The crossing number of K 1,4,n . Discrete Math. 308, 1634–1638 (2008)
Jendrol, S., Ščerbová, M.: On the crossing numbers of S m ×P n and S m ×C n . Časopis pro pěstování matematiky 107, 225–230 (1982)
Kleitman, D.J.: The crossing number of K 5,n . J. Combin. Theory 9, 315–323 (1970)
Klešč, M.: On the crossing numbers of Cartesian products of stars and paths or cycles. Mathematica Slovaca 41, 113–120 (1991)
Klešč, M.: The crossing numbers of products of paths and stars with 4-vertex graphs. J. Graph Theory 18, 605–614 (1994)
Klešč, M.: The crossing number of K 2,3 ×P n and K 2,3 ×S n . Tatra Mountains Math. Publ. 9, 51–56 (1996)
Klešč, M.: On the crossing numbers of products of stars and graphs of order five. Graphs and Combinatorics 17, 289–294 (2001)
Klešč, M.: The crossing numbers of Cartesian products of paths with 5–vertex graphs. Discrete Math. 233, 353–359 (2001)
Klešč, M.: Some crossing numbers of products of cycles. Discuss. Math. Graph Theory 25, 197–210 (2005)
Ringeisen, R.D., Beineke, L.W.: The crossing number of C 3 ×C n . J. Combin. Theory 24, 134–136 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klešč, M. (2009). On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices . In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-10217-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10216-5
Online ISBN: 978-3-642-10217-2
eBook Packages: Computer ScienceComputer Science (R0)