Relations between crossing numbers of complete and complete bipartite graphs

American Mathematical Monthly

Volumn 104, Issue 2, 1997, Pages 131-137

  Richter, R Bruce ^a   Thomassen, Carsten ^b  

^a CARLETON UNIVERSITY   (Canada)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031504393     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2974980     Document Type: Article

References (7)

1. M. R. Garey and D. S. Johnson, Crossing number is NP-complete, SIAM J. Alg. Disc. Meth. 4 (1983), 312-316.
2. R. K. Guy, The decline and fall of Zarankiewicz's theorem in Proof Techniques in Graph Theory, Academic Press, New York, 1969, pp. 63-69.
3. F. Harary, Graph Theory, Addison Wesley, Reading, MA, 1972.
4. 5, n, J. Combin. Theory 9 (1970), 315-322.
5. P. Turán, A note of welcome, J. Graph Theory 1 (1977), 7-9.
6. A. T. White, Topological graph theory, in Selected Topics in Graph Theory, Academic Press, New York.
7. D. R. Woodall, Cyclic-order graphs and Zarankiewicz's crossing-number conjecture, J. Graph Theory 17 (1993), 657-671.