Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference23 articles.
1. D. Bienstock and N. Dean, Bounds on rectilinear crossing numbers, submitted.
2. D. Bienstock and N. Dean, New results on polygonal crossing numbers, submitted.
3. H. deFraysseix, R. Pollack, and J. Pach, Small sets supporting Fáry embeddings of planar graphs,Proc. 20th STOC (1988), pp. 426–433.
4. P. Erdös and R. K. Guy, Crossing number problems,Amer. Math. Monthly 80 (1973), 52–58.
5. M. R. Garey and D. S. Johnson, Crossing number is NP-complete,SIAM J Algebraic Discete Methods 4 (1983), 312–316.
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献