Decycling graphs
Lowell W. Beineke, Robert C. Vandell · Journal of Graph Theory · 1997
In this paper, we introduce the decycling number of a graph as the minimum 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. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 59–77, 1997