The crossing number of Cm × Cn is as conjectured for n ≥ m(m+1)

Journal of Graph Theory

Volumn 47, Issue 1, 2004, Pages 53-72

  Glebsky, Lev Yu ^a   Salazar, Gelasio ^b  

^a LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

^b UNIVERSIDAD AUTÓNOMA DE SAN LUIS POTOSÍ   (Mexico)

Author keywords

Cartesian product of cycles; Crossing number; Graph drawing

Indexed keywords

COMBINATORIAL MATHEMATICS; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; THEOREM PROVING;

CROSS-CRITICAL GRAPHS; CROSSING NUMBER;

NUMBER THEORY;

EID: 4444382166     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20016     Document Type: Article

References (15)

1. J. Adamsson, Ph.D. Thesis, Carleton University, 2000.
2. n, J Combin Theory Series B 90 (2004), 21-39.
3. 6, Cong Numerantium 118 (1996), 97-107.
4. 7, Cong Numerantium 125 (1997), 97-117.
5. 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.
6. 4, J Graph Theory 19 (1995), 125-129.
7. F. Harary, P. C. Kainen, and A. J. Schwenk, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math 6 (1973), 58-67.
8. P. Hliněný, Crossing-critical graphs and path-width, Lecture Notes in Comput Sci 2265 (2002), 102-114.
9. P. Hliněný, Crossing-number critical graphs have bounded path-width, J Combin Theory, Series B 88 (2003), 347-367.
10. n with one disjoint family II, J Combin Theory Series B 82 (2001), 161-165.
11. n, J Graph Theory 22 (1996), 239-243.
12. n, Australasian J Combin 23 (2001), 135-143.
13. 5, Disc Comp Geom 13 (1995), 149-159.
14. n, J Combin Theory 24 (1978), 134-136.
15. n on surfaces, Discrete Comput Geom 19 (1998), 237-247.