Vertex rewriting in graphs is a very powerful mechanism which has been stud
ied for quite a long time. In this paper we eventually provide a categorica
l theory of vertex rewriting and show how it can extend in a uniform way to
node and pattern rewriting mechanisms in hypergraphs. (C) 2001 Elsevier Sc
ience B.V. All rights reserved.