The Book Crossing Number of a Graph

Journal of Graph Theory

Volumn 21, Issue 4, 1996, Pages 413-424

  Shahrokhi, Farhad ^a   Székely, László A ^b   Sýkora, Ondrej ^c   Vrt'o, Imrich ^c  

^a UNIVERSITY OF NORTH TEXAS   (United States)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^c INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1542790479     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-S     Document Type: Article

References (17)

1. M. Ajtai, V. Chvátal, M. Newborn, E. Szemerédy, Crossing-free subgraphs. Ann. Discrete Math. 12 (1982) 9-12.
2. N. Alon, J. H. Spencer, and P. Erdös, The Probabilistic Method, Wiley Sons, New York (1992).
3. D. Bienstock, Some provably hard crossing number problems. Disc. Comp. Geometry 6 (1991) 443-459.
4. F. Bernhart and P. C. Kainen, The book thickness of a graph. J. Combinat. Theory. Ser. B, 27 (1979) 320-331.
5. D. Bienstock and N. Dean, New results on rectilinear crossing numbers and plane embeddings. J. Graph Theory 16 (1992) 389-398.
6. D. Bienstock and N. Dean, Bounds on the rectilinear crossing numbers. J. Graph Theory 17 (1993) 333-348.
7. S. Bhatt and F. Leighton, A framework for solving VLSI graph layout problems. J. Comput. System Sci. 28 (1984) 300-343.
8. G. Chartrand and L. Lesniak, Graphs and Digraphs. Wadsworth and Books/Cole Mathematics Series, Pacific Grove, California (1986).
9. F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg, Embedding graphs in books: A layout problem with applications to VLSI design. SIAM J. Alg. Discrete Meth. 8 (1987) 33-58.
10. F. R. K. Chung and S. T. Yau, A near optimal algorithm for edge separators. Proc. 26th Symposium on Theory of Computing, New York, NY (1994) 1-8.
11. M. R. Garey and D. S. Johnson, Crossing number is NP-complete. SIAM J. Alg. Disc. Math 4 (1983) 312-316.
12. P. C. Kainen, The book thickness of a graph, II. Congres. Numer. 71 (1990) 127-132.
13. F. T. Leighton, Complexity Issues in VLSI. MIT Press, Cambridge, MA (1983).
14. S. Masuda, T. Kashiwabara, K. Nakajima, and T. Fujisawa, on the NP-completeness of a computer network layout problem. Proceedings of the 1987 IEEE International Symposium on Circuits and Systems, IEEE Press, New York, NY (1987) 292-295.
15. S. Masuda, T. Kashiwabara, K. Nakajima, and T. Fujisawa, Crossing minimization in linear embeddings of graphs. IEEE Transact. Comput. 39 (1990) 124-127.
16. J. Pach, F. Shahrokhi, and M. Szegedy, Applications of crossing numbers. Proceedings of the 10th Annual ACM Symposium on Computational Geometry, ACM Press (1994).
17. F. Shahrokhi, O. Sýkora, L. A. Székely, and I. Vrt'o, Improved bounds for the crossing numbers on surfaces of genus g Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93, Lecture Notes in Computer Science, 790, Springer Verlag, Berlin (1994) 388-395.