Author:
Ackerman Eyal,Fulek Radoslav,Tóth Csaba D.
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J.Combinatorial Theory, Ser. A. 114(3), 563–571 (2007)
2. Lecture Notes in Computer Science;P. Angelini,2010
3. Lecture Notes in Computer Science;K. Arikushi,2010
4. Arikushi, K., Tóth, C.D.: Crossing angles of geometric graphs (manuscript) (2010)
5. Lecture Notes in Computer Science;W. Didimo,2009
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Nonplanar Graph Drawings with k Vertices per Face;Graph-Theoretic Concepts in Computer Science;2023
2. Drawings of Graphs;Discrete Mathematics and Its Applications;2013-11-26
3. 2-Layer Right Angle Crossing Drawings;Algorithmica;2012-11-08
4. The Crossing-Angle Resolution in Graph Drawing;Thirty Essays on Geometric Graph Theory;2012-10-29
5. Vertex angle and crossing angle resolution of leveled tree drawings;Information Processing Letters;2012-08