Author:
Ábrego Bernardo M.,Aichholzer Oswin,Fernández-Merchant Silvia,Ramos Pedro,Salazar Gelasio
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference12 articles.
1. Ábrego, B., Aichholzer, O., Fernández-Merchant, S., Ramos, P.: The 2-page crossing number of $$K_{n}$$ K n . Discrete Comput. Geom. 49(4), 747–777 (2013)
2. Ábrego, B., Oswin, A., Fernández-Merchant, S., Ramos, S., Gelasio, S.: More on the crossing number of $$ K_n $$ K n : monotone drawings. In: Electronic Notes in Discrete Mathematics, vol. 44, pp. 411–414 (2013) (Special volume dedicated to the papers of LAGOS VII, Playa del Carmen, Mexico)
3. Ábrego, B., Aichholzer, O., Fernández-Merchant, S., Ramos, P., Salazar, G.: The 2-page crossing number of $$K_n$$ K n . In: 28th ACM Symposium on Computational Geometry, pp. 397–404 (2012)
4. Balko, M., Fulek, R., Kynčl, J.: Monotone crossing number of complete graphs. In: Proceedings of the XV Spanish Meeting on Computational Geometry (Sevilla, 26–28 June, 2013), pp. 127–130
5. Blažek, J., Koman, M.: A minimal problem concerning complete plane graphs. In: Fiedler, M. (ed.) Theory of Graphs and Its Applications, pp. 113–117. Czech Academy of Science, Prague (1964)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献