Discussiones Mathematicae Graph Theory 33(3) (2013)
583-597

doi: 10.7151/dmgt.1705

of order six

Marián Klešč and š. Schrötter
Faculty of Electrical Engineering and Informatics |

**Keywords:** graph, drawing, crossing number, Cartesian product, join product, star

**2010 Mathematics Subject Classification:** 05C10, 05C38.

[1] | K. Asano, The crossing number of , J. Graph Theory K and _{1,3,n}K_{2,3,n} 10 (1986) 1--8, doi: 10.1002/jgt.3190100102. |

[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 . |

[3] | D. Bokal, On the crossing number of Cartesian products with paths, J. Combin. Theory (B) 97 (2007) 381--384, doi: 10.1016/j.jctb.2006.06.003 . |

[4] | D. Bokal, On the crossing numbers of Cartesian products with trees, J. Graph Theory 56 (2007) 287--300, doi: 10.1002/jgt.20258 . |

[5] | M. Draženská and M. Klešč, The crossing numbers of products of the graph , Carpathian J. Math. K with stars_{2,2,2} 24 (2008) 327--331. |

[6] | L.Y. Glebsky and G. Salazar, The crossing number of , J. Graph Theory C is as conjectured for _{m} × C_{n}n ≥ m(m+1) 47 (2004) 53--72, doi: 10.1002/jgt.20016. |

[7] | F. Harary, P.C. Kainen and A.J. Schwenk, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math 6 (1973) 58--67. |

[8] | X. He, The crossing number of Cartesian products of stars with , in: 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010, Wuhan, December 2010.5-vertex graphs |

[9] | P.T. Ho, The crossing number of , Far East J. Appl. Math. K_{2,2,2,n} 30 (2008) 43--69. |

[10] | Y. Huang and T. Zhao, The crossing number of , Discrete Math. K_{1,4,n} 308 (2008) 1634--1638, doi: 10.1016/j.disc.2006.12.002 . |

[11] | S. Jendrol', and M. Ščerbová, On the crossing numbers of , Časopis pro Pěstování Matematiky S and _{m} × P_{n}S_{m} × C_{n} 107 (1982) 225--230. |

[12] | D.J. Kleitman, The crossing number of , J. Combin. Theory (B) K_{5,n} 9 (1971) 315--323. |

[13] | M. Klešč, The crossing numbers of Cartesian products of stars and paths or cycles, Math. Slovaca 41 (1991) 113--120. |

[14] | M. Klešč, The crossing numbers of products of paths and stars with , J. Graph Theory 4-vertex graphs 18 (1994) 605--614. |

[15] | M. Klešč, The crossing number of , Tatra Mt. Math. Publ. K and _{2,3} × P_{n}K_{2,3} × S_{n} 9 (1996) 51--56. |

[16] | M. Klešč, On the crossing numbers of products of stars and graphs of order five, Graphs Combin. 17 (2001) 289--294, doi: 10.1007/s003730170042 . |

[17] | M. Klešč, The join of graphs and crossing numbers, Electron. Notes Discrete Math. 28 (2007) 349--355, doi: 10.1016/j.endm.2007.01.049 . |

[18] | M. Klešč, On the crossing numbers of Cartesian products of stars and graphs on five vertices, Combinatorial Algorithms, Springer, LNCS 5874 (2009) 324--333, doi: 10.1007/978-3-642-10217-2_32 . |

[19] | V.R. Kulli and M.H. Muddebihal, Characterization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87--97. |

[20] | S. Lü and Y. Huang, On the crossing numner of , J. Math. Res. Expo. K_{5} × S_{n} 28 (2008) 445--459. |

[21] | H. Mei and Y. Huang, The crossing number of , Internat. J. Math. Combin. K_{1,5,n} 1 (2007) 33--44. |

[22] | K. Zarankiewicz, On a problem of P. Turán concerning graphs, Fund. Math 41 (1954) 137--145. |

Received 30 November 2011

Revised 20 May 2013

Accepted 20 May 2013