1. Arnborg, S., Courcelle, B., Proskurowski, A. and Seese, D.: “An Algebraic Theory of Graph Reduction,” Research Report n° 91–36, Bordeaux-I University, 1991.
2. Ball, M. O.: “Complexity of Network Reliability Computations,” Networks, Vol. 10, pp. 153–165, 1980.
3. Barendreght, H.P.: “The Lambda Calculus-Its Syntax and Semantics,” Revised Edition, North Holland, 1984.
4. Bauderon, Y. and Courcelle, B.: “Graph Expression and Graph Rewritings,” Mathematical Systems Theory, 20, pp. 83–127, 1987.
5. Brandenburg, F.J.: “On context-free graph grammars with bounded degrees” Proceedings of Toyohashi Symposium on Theoretical Computer Science, pp. 23–26 August, 1990.