Show that a graph $G$ is a forest if and only if every induced subgraph of $G$ contains a vertex of degree at most $1$
Prove that a graph $G$ is a forest if and only if every induced subgraph of $G$ contain a vertex of degree at most $1$