Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Kratochvil J., Lubiw A., Nesetril J., “Noncrossing Subgraphs in Topological Layouts”, SIAM J. Disc. Math, 4:2 (1991), 223–244 | DOI | MR | Zbl
[2] Cerny J., Dvorak Z., Jelinek V., Kara J., “Noncrossing Hamiltonian paths in geometric graphs”, Disc. Appl. Math, 155:9 (2007), 1096–1105 | DOI | MR | Zbl
[3] Kaneko A., Kano M., Suzuki K., “Balanced Partitions and Path Covering of Two Sets of Points in the Plane”, Comput. Geom.: Theory and Applications, 13, 1999, 253–261 | MR | Zbl
[4] Abellanas M., Garcia G., Hernandez G., Noy M., Ramos P., “Bipartite embedings of trees in the plane”, Disc. Appl. Math, 93 (1999), 141–148 | DOI | MR | Zbl
[5] Benediktovich V.I., “Ostovnoe derevo bez samoperesechenii v geometricheskom dopolnenii 2-faktora”, III nauch. konf. “Teoriya raspisanii i metody dekompozitsii. Tanaevskie chteniya”, OIPI NAN Belarusi, Minsk, 2007, 15–19
[6] Karolyi G., Pach J., Toth G., Ramsey-type Results for Geometric Graphs I, DIMACS Technical Report 95–49, 1995, 10 pp.
[7] Hernando M., Hurtado A., Marquez A., Mora M., Noy M., “Geometric tree graphs of points in convex position”, Disc. Appl. Math, 93 (1999), 51–66 | DOI | MR | Zbl