Drawings of Cm×Cn with One Disjoint Family

Journal of Combinatorial Theory. Series B

Volumn 76, Issue 2, 1999, Pages 129-135

  Salazar, Gelasio ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348098694     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1890     Document Type: Article

References (9)

1. 7, preprint.
2. Beineke L. W., Ringeisen R. D. On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory. 4:1980;145-155.
3. Harary F., Kainen P. C., Schwenk A. J. Toroidal graphs with arbitrarily high crossing numbers. Nanta Math. 6:1973;58-67.
4. n. J. Graph Theory. 22:1996;239-243.
5. 5. Discrete Comput. Geom. 13:1995;149-159.
6. Richter R. B., Thomassen C. Minimal graphs with crossing number at least k. J. Combin. Theory Ser. B. 58:1993;217-224.
7. n. J. Combin. Theory. 24:1978;134-136.
8. G. Salazar, Ph.D. thesis, Carleton University, 1997.
9. White A., Beineke L. W. Topological graph theory. Beineke L. W., Wilson R. J. Selected Topics in Graph Theory. 1978;15-49 Academic Press, London/New York.