Intersection of curves and crossing number of Cm × Cn on surfaces

Discrete and Computational Geometry

Volumn 19, Issue 2, 1998, Pages 237-247

  Shahrokhi, F ^a   Sykora O ^b   Szekely L A ^c   Vrt'o, I ^b  

^a UNIVERSITY OF NORTH TEXAS   (United States)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040005860     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009343     Document Type: Article

References (19)

1. 6. Preprint.
2. L. W. Beineke and R. D. Ringeisen. On the crossing number of product of cycles and graphs of order four. J. Graph Theory 4 (1980), 145-155.
3. R. A. Fenn. Techniques of Geometric Topology. London Mathematical Society Lecture Notes Series, vol. 57. Cambridge University Press, Cambridge, 1983.
4. F. Harary, P. C. Kainen, and A. Schwenk. Toroidal graphs with arbitrary high crossing numbers. Nanta Math. 6 (1973), 58-67.
5. M. Jungermann. The non-orientable genus of the n-cube. Pacific J. Math. 76 (1978), 443-451.
6. p,q, and Q(d). J. Combin. Theory Ser. B 12 (1972), 287-298.
7. P. C. Kainen and A. T. White. On stable crossing numbers. J. Graph Theory 2 (1978), 181-187.
8. 5,n. J. Combin. Theory 9 (1970), 315-323.
9. n. J. Graph Theory 22 (1996), 239-244.
10. D. Larman, J. Matoušek, J. Pach, and J. Töröcsik. A Ramsey-type result for planar convex sets. To appear.
11. F. T. Leighton. Complexity Issues in VLSI. MIT Press, Cambridge, MA, 1983.
12. J. Pach and J. Töröcsik. Some geometric applications of Dilworth's theorem. Discrete Comput. Geom. 21 (1994), 1-7.
13. 5. Discrete Comput. Geom. 13 (1995), 149-159.
14. n. J. Combin. Theory Ser. B 24 (1978), 134-144.
15. n. J. Graph Theory 17 (1993), 683-693.
16. A. Schrijver. Min-max results in combinatorial optimization. In: Mathematical Programming: The State of the Art (A. Bachem, M. Grötchel, B. Körte, eds.). Springer-Verlag, Berlin, 1983, pp. 439-500.
17. F. Shahrokhi, O. Sýkora, L. A. Székely, and I. Vrt'o. Crossing numbers of meshes. In: Proc. Internat. Symposium on Graph Drawings '95. Lecture Notes in Computer Science, vol. 1027. Springer-Verlag, Berlin, 1996.
18. F. Shahrokhi, L. A. Székely, and I. Vrt'o. Crossing numbers of graphs, lower bound techniques and algorithms: A survey. In: Proc. DIMACS Workshop on Graph Drawing '94. Lecture Notes Computer Science, vol. 894. Springer-Verlag, Berlin, 1995, pp. 131-142.
19. A. T. White and L. W. Beineke. Topological graph theory. In: Selected Topics in Graph Theory (Beineke and Wilson, eds.). Academic Press, New York, 1978, pp. 15-50.