Drawings of Cm×Cn with One Disjoint Family

M. Anderson, R. B. Richter, and, P. Rodney, The crossing number of C7×C7, preprint. Beineke, 1980, On the crossing numbers of products of cycles and graphs of order four, J. Graph Theory, 4, 145, 10.1002/jgt.3190040203 Harary, 1973, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math., 6, 58 Klešč, 1996, The crossing number of C5×Cn, J. Graph Theory, 22, 239, 10.1002/(SICI)1097-0118(199607)22:3<239::AID-JGT4>3.0.CO;2-N Richter, 1995, Intersections of curve systems and the crossing number of C5×C5, Discrete Comput. Geom., 13, 149, 10.1007/BF02574034 Richter, 1993, Minimal graphs with crossing number at least k, J. Combin. Theory Ser. B, 58, 217, 10.1006/jctb.1993.1038 Ringeisen, 1978, The crossing number of C3×Cn, J. Combin. Theory, 24, 134, 10.1016/0095-8956(78)90014-X G. Salazar, Ph.D. thesis, Carleton University, 1997. White, 1978, Topological graph theory, 15