Crossing number is hard for cubic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 772-782

  Hlinêný, Petr ^a,b  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Crossing number; Cubic graph; NP completeness

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CROSSING NUMBER; CUBIC GRAPH; NP-COMPLETENESS; NP-HARD; SIMPLE CUBIC;

COMPUTATIONAL COMPLEXITY;

EID: 34249057028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_60     Document Type: Article

References (10)

1. M.R. Fellows, The Robertson-Seymour Theorems: A Survey of Applications, Contemp. Math. 89 (1989), 1-18.
2. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York 1979.
3. M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983), 312-316.
4. n is as conjectured for n > m(m + 1), J. Graph Theory, to appear.
5. M. Grohe, Computing Crossing Numbers in Quadratic Time, In: 32nd ACM Symposium on Theory of Computing STOC '01, (2001), 231-236.
6. R.K. Guy, The decline and fall of Zarankiewic's theorem, in: Proc. Proof Techniques in Graph Theory (F. Harary ed.), Academic Press, N.Y. 1969, 63-69.
7. F. Harary, P.C. Kainen, A. J. Schwenk, Toroidal graphs with arbitrarily high crossing numbers, Nanta Math. 6 (1973), 58-67.
8. n, J. Graph Theory 22 (1996), 239-243.
9. J. Pach, G. Tóth, Which crossing number is it, anyway?, Proc. 39th Foundations of Computer Science (1998), IEEE Press 1999, 617-626.
10. R.B. Richter, A problem submitted to: Problems in Topological Graph Theory (D. Archdeacon), http://www.emba.uvm.edu/̃archdeac/problems/ problems.html.