The crossing number of a graph on a compact 2-manifold

Advances in Mathematics

Volumn 123, Issue 2, 1996, Pages 105-119

  Shahrokhi, F ^b   Sykora O ^b   Szekely L A ^a   Vrto I ^b  

^a Inst für Diskrete Mathematik   (Germany)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 16144366292     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1006/aima.1996.0069     Document Type: Article

References (23)

1. [Br23] H. R. Brahana, Systems of circuits of two-dimensional manifolds, Ann. of Math. 30 (1923), 234-243.
2. [BH65] L. W. Beineke and F. Harary, The genus of the n-cube, Canad. J. of Math. 17 (1965), 494-496.
3. [CHK63] D. E. Cohen, F. Harary, and Y. Kodama, On the embedding of complete graphs in orientable surfaces, Mathematika 10 (1963), 79-83.
4. [CL86] G. Chartrand and L. Lesniak, "Graphs and Digraphs," Wadsworth and Books/Cole Mathematics Series, 1986.
5. [GJ83] M. R. Garey and D. S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic and Discrete Methods 4 (1983), 312-316.
6. m, n, J. Combinatorial Theory 6 (1969), 235-250.
7. [GJS68] R. K. Guy, T. Jenkins, and J. Schaer, The toroidal crossing number of the complete graph, J. Combinatorial Theory 4 (1968), 376-390.
8. [Ju78] M. Jungerman, The non-orientable genus of the n-cube, Pacific J. Math. 76 (1978), 443-451.
9. p, q and Q(d), J. Combin. Theory Ser. B 12 (1972), 287-298.
10. [KW78] P. C. Kainen and A. T. White, On stable crossing numbers, J. Graph Theory 2 (1978), 181-187.
11. [KNS64] G. Katona, T. Nemetz, and M. Simonovits, On a graph-problem of Turán, Mat. Lapok 15 (1964), 228-238. [in Hungarian].
12. 5, n, J. Combinatorial Theory 9 (1970), 315-323.
13. [Le83] F. T. Leighton, "Complexity Issues in VLSI," M.I.T. Press, Cambridge, MA, 1983.
14. [Ma91] T. Madej, Bounds for the crossing number of the n-cube, J. Graph Theory 15 (1991), 81-97.
15. [Ra86] P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, in "Proceedings 27 th Annual IEEE Symposium on the Foundations of Comupter Science, 1986," pp. 10-18.
16. [Ri55] G. Ringel, Über drei kombinatorische Probleme am n-dimensionalen Würfel und Würfelgitter, Abh. Sem. Univ. Hamburg 20 (1955), 10-19.
17. [Sp72] J. Spencer, Turán's theorem for k-graphs, Discrete Math. 2 (1972), 183-186.
18. [SS91] F. Shahrokhi and L. A. Székely, An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Technical Report CRPDC-91-4, Dept. Computer Science, Univ. of North Texas.
19. [SS92] F. Shahrokhi and L. A. Székely, Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, in "Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25-27, 1992, by the Mathematical Programming Society" (E. Balas, G. Cournejols, and R. Kannan, Eds.), pp. 102-113, CMU Press, 1992. See also Combinatorics, Probability and Computing 3 (1994), 523-543.
20. [SS92] F. Shahrokhi and L. A. Székely, Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, in "Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25-27, 1992, by the Mathematical Programming Society" (E. Balas, G. Cournejols, and R. Kannan, Eds.), pp. 102-113, CMU Press, 1992. See also Combinatorics, Probability and Computing 3 (1994), 523-543.
21. [SV92a] O. Sýkora and I. Vrťo, On the crossing number of hypercubes and cube connected cycles, in "Proc. 17th Intl. Workshop on Graph Theoretic Concepts in Computer Science WG'91" (G. Schmidt and R. Berghammer, Eds.), LNCS 570, Springer-Verlag, Berlin, 1992, pp. 214-218.
22. [SV92b] O. Sýkora and I. Vrťo, Edge separators for graphs of bounded genus with applications, in "Proceedings of the 17th International Workshop on Graph Theoretic Concepts in Computer Science WG'91" (G. Schmidt and R. Berghammer, Eds.), LNCS 570, Springer-Verlag, Berlin, 1992, pp. 159-168.
23. [WB78] A. T. White and L. W. Beineke, Topological graph theory, in "Selected Topics in Graph Theory" (L. W. Beineke and R. J. Wilson, Eds.), Academic Press, 1978, pp. 15-50.