On the crossing numbers of G □ Cₙ for graphs G on six vertices

Emília Draženská; Marián Klešč

Discussiones Mathematicae Graph Theory (2011)

  • Volume: 31, Issue: 2, page 239-252
  • ISSN: 2083-5892

Abstract

top
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of G☐Cₙ for some graphs G on five and six vertices and the cycle Cₙ are also given. In this paper, we extend these results by determining crossing numbers of Cartesian products G☐Cₙ for some connected graphs G of order six with six and seven edges. In addition, we collect known results concerning crossing numbers of G☐Cₙ for graphs G on six vertices.

How to cite

top

Emília Draženská, and Marián Klešč. "On the crossing numbers of G □ Cₙ for graphs G on six vertices." Discussiones Mathematicae Graph Theory 31.2 (2011): 239-252. <http://eudml.org/doc/270803>.

@article{EmíliaDraženská2011,
abstract = {The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of G☐Cₙ for some graphs G on five and six vertices and the cycle Cₙ are also given. In this paper, we extend these results by determining crossing numbers of Cartesian products G☐Cₙ for some connected graphs G of order six with six and seven edges. In addition, we collect known results concerning crossing numbers of G☐Cₙ for graphs G on six vertices.},
author = {Emília Draženská, Marián Klešč},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {graph; cycle; drawing; crossing number; Cartesian product},
language = {eng},
number = {2},
pages = {239-252},
title = {On the crossing numbers of G □ Cₙ for graphs G on six vertices},
url = {http://eudml.org/doc/270803},
volume = {31},
year = {2011},
}

TY - JOUR
AU - Emília Draženská
AU - Marián Klešč
TI - On the crossing numbers of G □ Cₙ for graphs G on six vertices
JO - Discussiones Mathematicae Graph Theory
PY - 2011
VL - 31
IS - 2
SP - 239
EP - 252
AB - The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of G☐Cₙ for some graphs G on five and six vertices and the cycle Cₙ are also given. In this paper, we extend these results by determining crossing numbers of Cartesian products G☐Cₙ for some connected graphs G of order six with six and seven edges. In addition, we collect known results concerning crossing numbers of G☐Cₙ for graphs G on six vertices.
LA - eng
KW - graph; cycle; drawing; crossing number; Cartesian product
UR - http://eudml.org/doc/270803
ER -

References

top
  1. [1] M. Anderson, R.B. Richter and P. Rodney, The crossing number of C₆×C₆, Congr. Numer. 118 (1996) 97-107. Zbl0896.05032
  2. [2] L.W. Beineke and R.D. Ringeisen, On the crossing numbers of products of cycles and graphs of order four, J. Graph Theory 4 (1980) 145-155, doi: 10.1002/jgt.3190040203. Zbl0403.05037
  3. [3] A.M. Dean and R.B. Richter, The crossing number of C₄×C₄, J. Graph Theory 19 (1995) 125-129, doi: 10.1002/jgt.3190190113. Zbl0813.05018
  4. [4] E. Draženská and M. Klešč, The crossing numbers of products of cycles with 6-vertex trees, Tatra Mt. Math. Publ. 36 (2007) 109-119. Zbl1175.05040
  5. [5] E. Draženská, The crossing numbers of G☐Cₙ for the graph G on six vertices, Mathematica Slovaca (to appear). Zbl1274.05091
  6. [6] L.Y. Glebsky and G. Salazar, The crossing number of Cₘ×Cₙ is as conjectured for n ≥ m(m+1), J. Graph Theory 47 (2004) 53-72, doi: 10.1002/jgt.20016. Zbl1053.05032
  7. [7] F. Harary, P.C. Kainen and A.J. Schwenk, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math. 6 (1973) 58-67. Zbl0285.05104
  8. [8] S. Jendrol' and M. Scerbová, On the crossing numbers of Sₘ×Pₙ and Sₘ×Cₙ, Casopis pro pestování matematiky 107 (1982) 225-230. 
  9. [9] M. Klešč, On the crossing numbers of Cartesian products of stars and paths or cycles, Mathematica Slovaca 41 (1991) 113-120. Zbl0755.05067
  10. [10] M. Klešč, The crossing numbers of Cartesian products of paths with 5-vertex graphs, Discrete Math. 233 (2001) 353-359, doi: 10.1016/S0012-365X(00)00251-X. Zbl0983.05027
  11. [11] M. Klešč, The crossing number of K 2 , 3 × C , Discrete Math. 251 (2002) 109-117, doi: 10.1016/S0012-365X(01)00332-6. 
  12. [12] M. Klešč, Some crossing numbers of products of cycles, Discuss. Math. Graph Theory 25 (2005) 197-210, doi: 10.7151/dmgt.1272. Zbl1078.05025
  13. [13] M. Klešč, R.B. Richter and I. Stobert, The crossing number of C₅×Cₙ, J. Graph Theory 22 (1996) 239-243. Zbl0854.05036
  14. [14] M. Klešč and A. Kocúrová, The crossing numbers of products of 5-vertex graphs with cycles, Discrete Math. 307 (2007) 1395-1403, doi: 10.1016/j.disc.2005.11.077. Zbl1118.05021
  15. [15] R.B. Richter and C. Thomassen, Intersection of curve systems and the crossing number of C₅×C₅, Discrete Comp. Geom. 13 (1995) 149-159, doi: 10.1007/BF02574034. Zbl0820.05015
  16. [16] R.B. Richter and G. Salazar, The crossing number of C₆×Cₙ, Australasian J. Combin. 23 (2001) 135-144. Zbl0972.05015
  17. [17] R D. Ringeisen and L.W. Beineke, The crossing number of C₃×Cₙ, J. Combin. Theory (B) 24 (1978) 134-136, doi: 10.1016/0095-8956(78)90014-X. Zbl0383.05015
  18. [18] W. Zheng, X. Lin, Y. Yang and C. Deng, On the crossing number of Kₘ ☐ Cₙ and K m , l P , Discrete Appl. Math. 156 (2008) 1892-1907. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.