The forest number in several classes of regular graphs
Keywords:
forest number, path number, tree numberAbstract
For a graph and
, if
is acyclic, then
is said to be an induced forest of
. The size of a maximum induced forest of
is called the forest number of
and is denoted by
. The purpose of this paper is to provide a review of recent results and open problems on the forest number of graphs and in some classes of graphs.
