In this paper, we introduce the decycling number of a graph as the min
imum number of vertices that must be removed in order to eliminate all
cycles. After proving some general results, we focus on two families
of graph products, the grids and the hypercubes. (C) 1997 John Wiley &
Sons, Inc.