A lower bound for the crossing number of Cm × Cn

Journal of Graph Theory

Volumn 35, Issue 3, 2000, Pages 222-226

  Salazar, Gelasio ^a  

^a INSTITUTO DE INVESTIGACIÓN EN COMUNICACIÓN ÓPTICA   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034365184     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0118(200011)35:3<222::AID-JGT7>3.0.CO;2-E     Document Type: Article

References (13)

1. 6, Cong Numer 118 (1996), 97-107.
2. 7, Cong Numer 125 (1997), 97-117.
3. 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.
4. 4, J Graph Theory 19 (1995), 125-129.
5. P. Erdös and R. K. Guy, Crossing number problems, Amer Math Monthly 80 (1973), 52-58.
6. F. Harary, P. C. Kainen, and A. J. Schwenk, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math 6 (1973), 58-67.
7. n, J Graph Theory 22 (1996), 239-243.
8. 5, Disc Comp Geom 13 (1995), 149-159.
9. n, J Combin Theory 24 (1978), 134-136.
10. G. Salazar, Ph.D. thesis. Carleton University (1997).
11. n with one disjoint family II (submitted).
12. n on surfaces, Discrete Comput Geom 19 (2) (1998), 237-247.
13. P. Turán, A note of welcome, J Graph Theory 1 (1977), 7-9.