Arrangements, circular arrangements and the crossing number of C7 × Cn

Journal of Combinatorial Theory. Series B

Volumn 90, Issue 1, 2004, Pages 21-39

  Adamsson, Jay ^a   Richter, R Bruce ^b  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347129766     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2003.05.001     Document Type: Article

References (12)

1. J. Adamsson, The theory of arrangements, Ph.D. Dissertation, Carleton University, April 2000.
2. 6, Congr. Numer. 118 (1996) 97-107.
3. 7, Congr. Numer. 125 (1997) 97-117.
4. L.W. Beineke, R.D. Ringeisen, On the crossing numbers of products of cycles and graphs of order four, J. Graph Theory 4 (1980) 145-155.
5. 4, J. Graph Theory 19 (1995) 125-129.
6. n) = (m - 2)n is true for all but finitely many n, for each m, submitted for publication.
7. F. Harary, P.C. Kainen, A.J. Schwenk, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math. 6 (1973) 58-67.
8. n, J. Graph Theory 22 (1996) 239-243.
9. n, Austral. J. Combin. 23 (2001) 135-143.
10. 5, Discrete Comput. Geom. 13 (1995) 149-159.
11. n, J. Combin. Theory 24 (1978) 134-136.
12. n with one disjoint family, J. Combin. Theory Ser. B 76 (1999) 129-135.