1. Alberts, D., Cattaneo, G., & Italiano, G. F. (1997). An empirical study of dynamic graph algorithms. ACM Journal of Experimental Algorithms, 6, 1–39.
2. Araujo, L. H. (2004). Algoritmos dinâmicos para manutenção de grafos cordais e periplanares. Ph.D. Thesis, Coppe-Produção, Universidade Federal do Rio de Janeiro, RJ, Brasil.
3. Graph theory and sparse matrix computation;J. R. S. Blair,1993
4. Berry, A., Heggernes, P., & Villanger, Y. (2003). A vertex incremental approach for dynamically maintaining chordal graphs. In Proceedings of the 14th international symposium on algorithms and computation (ISAAC 2003), Springer LNCS 2906, pp. 47–57.
5. Chandran, L. S., Ibarra, L., Ruskey, F., & Sawada, J. (2003). Generating and characterizing the perfect elimination orderings of a chordal graph. Theoretical Computer Science, 307, 303–317.