Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. R. Adamec, M. Klazar, and P. Valtr, Generalized Davenport-Schinzel sequences with linear upper bound, Discrete Math. 108 (1992), 219–229.
2. P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, and M. Sharir, Quasi-planar graphs have a linear number of edges, Graph Drawing (Passau, 1995), Lecture Notes in Comput. Sci. 1027 (1995), 1–7.
3. H. Davenport and A. Schinzel, A combinatorial problem connected with differential equations, Amer. J. Math. 87 (1965), 684–694.
4. R. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics 51 (1950), 161–166.
5. P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Geodesic obstacle representation of graphs;Computational Geometry;2023-02
2. Quasi-planar Graphs;Beyond Planar Graphs;2020
3. A Survey on Graph Drawing Beyond Planarity;ACM Computing Surveys;2019-02-28
4. Outerstring Graphs are $\chi$-Bounded;SIAM Journal on Discrete Mathematics;2019-01
5. Coloring Curves that Cross a Fixed Curve;Discrete & Computational Geometry;2018-10-01