Author:
Černý Jakub,Kynčl Jan,Tóth Géza
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Alon N., Hoory S., Linial N.: The Moore bound for irregular graphs. Graphs Combin 18, 53–57 (2002)
2. Černý, J., Kynčl, J., Tóth, G.: Improvement on the decay of crossing numbers. In: Proceedings of the 15th International Symposium on Graph Drawing (Graph Drawing 2007). Lecture Notes in Computer Science, vol. 4875, pp. 25–30. Springer, Berlin (2008)
3. Fox J., Tóth Cs: On the decay of crossing numbers. J. Combin. Theory Ser B 98(1), 33–42 (2008)
4. Leighton T.: Complexity Issues in VLSI. MIT Press, Cambridge (1983)
5. Pach, J., Radoičić, R., Tardos, G., Tóth, G.: Improving the Crossing Lemma by finding more crossings in sparse graphs. In: Proceedings of the 19th ACM Symposium on Computational Geometry, pp. 68–75 (2004) [Also in Discrete Comput. Geom. 36, 527–552 (2006)]
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献