Geodesic
The crossing numbers of products of a 5-vertex graph with paths and cycles
Discussiones Mathematicae. Graph Theory, Tome 19 (1999) no. 1, pp. 59-69.

Voir la notice de l'article provenant de la source Library of Science

There are several known exact results on the crossing numbers of Cartesian products of paths, cycles or stars with "small" graphs. Let H be the 5-vertex graph defined from K₅ by removing three edges incident with a common vertex. In this paper, we extend the earlier results to the Cartesian products of H × Pₙ and H × Cₙ, showing that in the general case the corresponding crossing numbers are 3n-1, and 3n for even n or 3n+1 if n is odd.
Keywords: graph, drawing, crossing number, path, cycle, Cartesian product 
@article{DMGT_1999_19_1_a4,
     author = {Kle\v{s}\v{c}, Mari\'an},
     title = {The crossing numbers of products of a 5-vertex graph with paths and cycles},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {59--69},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {1999},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a4/}
}
TY  - JOUR
AU  - Klešč, Marián
TI  - The crossing numbers of products of a 5-vertex graph with paths and cycles
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1999
SP  - 59
EP  - 69
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a4/
LA  - en
ID  - DMGT_1999_19_1_a4
ER  - 
%0 Journal Article
%A Klešč, Marián
%T The crossing numbers of products of a 5-vertex graph with paths and cycles
%J Discussiones Mathematicae. Graph Theory
%D 1999
%P 59-69
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a4/
%G en
%F DMGT_1999_19_1_a4
Klešč, Marián. The crossing numbers of products of a 5-vertex graph with paths and cycles. Discussiones Mathematicae. Graph Theory, Tome 19 (1999) no. 1, pp. 59-69. http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a4/

[1] D. Archdeacon, R.B. Richter, On the parity of crossing numbers, J. Graph Theory 12 (1988) 307-310, doi: 10.1002/jgt.3190120302.

[2] L.W. Beineke, 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] F. Harary, Graph Theory (Addison - Wesley, Reading, MA, 1969).

[4] S. Jendrol', M. S cerbová, On the crossing numbers of Sₘ × Pₙ and Sₘ × Cₙ, Casopis pro pestování matematiky 107 (1982) 225-230.

[5] M. Klešč, On the crossing numbers of Cartesian products of stars and paths or cycles, Mathematica Slovaca 41 (1991) 113-120.

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

[7] M. Klešč, The crossing numbers of certain Cartesian products, Discuss. Math. Graph Theory 15 (1995) 5-10, doi: 10.7151/dmgt.1001.

[8] M. Klešč, The crossing number of $K_{2,3} × Pₙ$ and $K_{2,3} × Sₙ$, Tatra Mountains Math. Publ. 9 (1996) 51-56.

[9] M. Klešč, R.B. Richter, I. Stobert, The crossing number of C₅ × Cₙ, J. Graph Theory 22 (1996) 239-243.

[10] A.T. White, L.W. Beineke, Topological graph theory, in: Selected Topics in Graph Theory (Academic Press, London, 1978) 15-49.