Before revision:  It has already been proved that burning of path forests, spider graphs, and trees with maximum degree three are NP-Complete.
After revision:  It has already been proved that burning of path forests, spider graphs, and trees with maximum degree three is already known to be NP-Complete.