Author:
Ackerman Eyal,Tardos Gábor
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. E. Ackerman, On the maximum number of edges in topological graphs with no four pairwise crossing edges, in: Proc. 22nd ACM Symp. on Computational Geometry, Sedona, AZ, June 2006, pp. 259–263
2. Quasi-planar graphs have a linear number of edges;Agarwal;Combinatorica,1997
3. Every planar map is four colorable. Part I. Discharging;Appel;Illinois J. Math.,1997
4. O. Aichholzer, H. Krasser, The point set order type data base: A collection of applications and results, in: Proc. 13th Canadian Conf. on Computational Geometry, Waterloo, Ontario, Canada, August 2001, pp. 17–20
5. A Turán-type problem on chords of a convex polygon;Capoyleas;J. Combin. Theory Ser. B,1992
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献