Geodesic
The crossing numbers of certain Cartesian products
Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 1, pp. 5-10.

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

In this article we determine the crossing numbers of the Cartesian products of given three graphs on five vertices with paths.
Keywords: graph, drawing, crossing number, path, Cartesian product 
@article{DMGT_1995_15_1_a0,
     author = {Kle\v{s}\v{c}, Mari\'an},
     title = {The crossing numbers of certain {Cartesian} products},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {5--10},
     publisher = {mathdoc},
     volume = {15},
     number = {1},
     year = {1995},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a0/}
}
TY  - JOUR
AU  - Klešč, Marián
TI  - The crossing numbers of certain Cartesian products
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1995
SP  - 5
EP  - 10
VL  - 15
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a0/
LA  - en
ID  - DMGT_1995_15_1_a0
ER  - 
%0 Journal Article
%A Klešč, Marián
%T The crossing numbers of certain Cartesian products
%J Discussiones Mathematicae. Graph Theory
%D 1995
%P 5-10
%V 15
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a0/
%G en
%F DMGT_1995_15_1_a0
Klešč, Marián. The crossing numbers of certain Cartesian products. Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 1, pp. 5-10. http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a0/

[1] L. W. Beineke, R. D. Ringeisen, On the crossing numbers of producs of cycles and graphs of order four, J. Graph Theory 4 (1980) 145-155, doi: 10.1002/jgt.3190040203.

[2] S. Jendrol', M. Ščerbovâ, On the crossing numbers of Sₘ × Pₙ and Sₘ × Cₙ, Casopis pro pestováni matematiky 107 (1982) 225-230.

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

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