Author:
Cano Javier,Díaz-Báñez José-Miguel,Huemer Clemens,Urrutia Jorge
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Aichholzer O., Reinhardt K.: A quadratic distance bound on sliding between crossing-free spanning trees. Comput. Geom. Theory Appl. 37(3), 155–161 (2007)
2. Bose P., Hurtado F.: Flips in planar graphs. Comput. Geom. Theory Appl. 42(1), 60–80 (2009)
3. Estivill-Castro V., Noy M., Urrutia J.: On the chromatic number of tree graphs. Discret. Math. 223(1–3), 363–366 (2000)
4. Goddard W., Swart H.C.: Distances between graphs under edge operations. Discret. Math. 161, 121–132 (1996)
5. Hernando, C., Hurtado, F., Mora, M., Rivera-Campo, E.: Grafos de árboles etiquetados y grafos de árboles geométricos etiquetados. In: Proc. X Encuentros de Geometría Computacional, pp. 13–19 (2003)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献