A directed graph is said to be a tree if it has a root and there is a unique directed path from the root to every node in the tree. An equivalent characterization of a tree is that the root node has ...

Ten years ago many graph theorists believed that a self-contained proof of Theorem 7.0.1 would take the entire book. However, now a more accessible proof is possible. We present in Section 7.3 a short ...