Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference12 articles.
1. E. Ackerman, On the maximum number of edges in topological graphs with no four pairwise crossing edges, In: Proceedings of the 22nd ACM Symposium on Computational Geometry, ACM Press, New York, 2006, 259-263.
2. Crossing-free subgraphs, Ann Discrete Math;Ajtai,1982
3. Computational Geometry
4. On Crum's problem;Besicovitch;J London Math Soc,1947
5. On the structure of linear graphs;Erdős;Bull Amer Math Soc,1946
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献