On the Crossing Number of Complete Graphs-Reference-Cited by-同舟云学术

On the Crossing Number of Complete Graphs

Published:2005-08-25 Issue:1-2 Volume:76 Page:165-176
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Aichholzer O.,Aurenhammer F.,Krasser H.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00607-005-0133-3.pdf

Reference29 articles.

1. Ábrego, B., Fernández-Merchant, S.: A lower bound for the rectilinear crossing number. Graphs and Combinatorics (to appear).

2. Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. Proc. 18th Ann. ACM Symp. Comput. Geometry, Barcelona, Spain, 2002, pp. 19–24.

3. Aichholzer, O., Krasser, H.: The point set order type data base: a collection of applications and results. Proc. 13th Ann. Canadian Conf. Comput. Geometry CCCG 2001, Waterloo, Canada, 2001, pp. 17–20.

4. Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Proc. 21th Ann. ACM Symp. Computational Geometry 2005, Pise, Italy, pp. 91–98.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The crossing number of centrally symmetric complete geometric graphs;Procedia Computer Science;2021

2. An analogue of Sylvester’s four-point problem on the sphere;Acta Mathematica Hungarica;2018-03-17

3. Expected Crossing Numbers;Discrete Geometry and Optimization;2013

4. The Rectilinear Crossing Number of K n : Closing in (or Are We?);Thirty Essays on Geometric Graph Theory;2012-10-29

5. Expected Crossing Numbers;Electronic Notes in Discrete Mathematics;2011-12