Chantasartrassmee A.; Punnim N.
(2008)
Let G = (V,E) be a graph and F ⊆ V. Then F is called an induced forest of G if G[F] is acyclic. The forest number, denoted by f(G), of G is defined by f(G) := max {|F| : F is an induced forest of G}. We proved that if G ...