Crossing number is hard for cubic graphs

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 4, 2006, Pages 455-471

  Hliněný, Petr ^a,b  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Crossing number; Cubic graph; NP completeness

Indexed keywords

EID: 33646810118     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.09.009     Document Type: Article

References (14)

1. D. Bokal, G. Fijavž, B. Mohar, The minor crossing number, manuscript, 2005
2. Fellows M.R. The Robertson-Seymour theorems: A survey of applications. Contemp. Math. vol. 89 (1989), Amer. Math. Soc., Providence, RI 1-18
3. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, New York
4. Garey M.R., and Johnson D.S. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4 (1983) 312-316
5. I. Gitler, J. Leanos, G. Salazar, Crossing numbers of projective graphs, manuscript, 2005
6. n is as conjectured for n > m ( m + 1 ). J. Graph Theory 47 (2004) 53-72
7. Grohe M. Computing crossing numbers in quadratic time. J. Comput. System Sci. 68 (2004) 285-302
8. Guy R.K. The decline and fall of Zarankiewic's theorem. In: Harary F. (Ed). Proc. Proof Techniques in Graph Theory (1969), Academic Press, New York 63-69
9. Harary F., Kainen P.C., and Schwenk A.J. Toroidal graphs with arbitrarily high crossing numbers. Nanta Math. 6 (1973) 58-67
10. n. J. Graph Theory 22 (1996) 239-243
11. Pach J., and Tóth G. Which crossing number is it, anyway?. Proc. 39th Foundations of Computer Science, 1998 (1999), IEEE Press 617-626
12. M.J. Pelsmajer, M. Schaefer, D. Stefankovic, Odd crossing number is not crossing number, in: Graph Drawing 2005, in press
13. Richter R.B. A problem submitted to: Problems in Topological Graph Theory (D. Archdeacon). http://www.emba.uvm.edu/~archdeac/problems/problems.html
14. In: Robertson N., and Seymour P.D. (Eds). Open Problems, Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors. Seattle, 1991. Contemp. Math. vol. 147 (2003), Amer. Math. Soc., Providence, RI