An improved bound for the crossing number of Cm×C n: A self-contained proof using mostly combinatorial arguments

Graphs and Combinatorics

Volumn 20, Issue 2, 2004, Pages 247-253

  Salazar, Gelasio ^a   Ugalde, Edgardo ^a  

^a Instituto de Metalurgia   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444422442     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-003-0549-5     Document Type: Article

References (8)

1. n. (submitted)
2. n) = (m - 2)/n holds for all but finitely many values of n, for each m. (submitted)
3. Harary, F., Kainen, P.C., Schwenk, A.J.: Toroidal graphs with arbitrarily high crossing numbers. Nanta Math. 6, 58-67 (1973)
4. Hliněný, P.: Crossing-critical graphs and path-width. Lect Notes Comput. Sci. 2265, 102-114 (2002)
5. Hliněný, P.: Crossing-number critical graphs have bounded path-width. J. Comb. Theory, Ser. B 88, 347-367 (2003)
6. n with one disjoint family II. J. Comb. Theory, Ser. B 82, 161-165
7. n. J. Graph Theory. 22, 239-243 (1996)
8. n in surfaces. Discrete. Comput. Geom. 19, 237-247 (1998)