Solution
= Solution
{c}
\b[True.] Choose a root of the <tree (graph theory)> and color every vertex according to the parity of its graph distance from that root. The unique-path property implies that the endpoints of each edge have distances differing by one. Thus every edge crosses the two color classes, proving <bipartite graph>.