is it allowed to have nesting Induction?
For the base case, you do not need induction.
Hint: When all subgraphs $G$ have minimum degree at most 1, $G$ cannot include a cycle subgraph (why?). This means that $G$ is a in special class of graphs (which one?) that is always 2-colorable (how?).