Author:
Ábrego Bernardo M.,Fernández-Merchant Silvia
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. In: Proc. 18th Ann ACM Symp Comp Geom., Barcelona Spain, 2002, pp. 19–24
2. Brodsky, A., Durocher, S., Gethner, E.: Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. Discrete Math. 262, 59–77 (2003)
3. Guy, R.K.: The decline and fall of Zarankiewicz's theorem. In: Harary, F. (ed.), Proc. Proof Techniques in Graph Theory, New York, Academic Press, 1969, pp. 63–69
4. Goodman, J.E., Pollack, R.: Semispaces of configurations, cell complexes of arrangements in P2. J. Combin. Theory Ser. A 32, 1–19 (1982)
5. Goodman, J.E., Pollack, R.: A combinatorial version of the isotopy conjecture. In: Goodman, J.E., Lutwak, E., Malkevitch, J., Pollack R., (eds.), Discrete Geometry and Convexity, (Ann. New York Acad. Sci., vol. 440), 1985, pp. 12–19
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献