Abstract The gluing construction for graphs, which is used in algebraic theory of graph grammars and applied in several fields of Computer Science, is a pushout construction in the category of graphs. In addition to the well known universal properties of pushouts also several nonuniversal properties are required in algebraic graph theory. A systematic collection of these nonuniversal properties is presented in this paper.
Ehrig et al. (1979) studied this question.