Characteristic proof


Prove that each property below characterizes forests..

a. every induced subgraph has a vertex of degree at most one

in characterizes: do we prove the 2 ways like if and only if
or we can only prove it one sided