Potential rewording for Example 4.2.6

[SerDigby]

Hi,

Example 4.2.6 says "Explain why every tree is a bipartite graph."
The provided definition of a tree is "a connected graph containing no cycles". By this definition, a single vertex is a tree.
Since a single vertex cannot be bipartite, the question and solution might need to be reworded.

Thanks!

EDIT: I've been informed that a graph with no edges can be bipartite, so the question and solution don't have any issues. Cheers.

[oscarlevin]

Yeah, these "trivial" cases are annoying, and I often forget about them. So thanks for the heads up and keeping me honest.