For example, a tree with 5 nodes will have 4 edges, while a graph with 5 nodes can have anywhere from 0 to 10 edges. Another way to tell them apart is to look for cycles or loops in the graph.

Example 5.18: Branch and Bound Trees This example illustrates a nonstandard use of PROC NETDRAW. The TREE option in PROC NETDRAW is used to draw a branch and bound tree such as one that you obtain in ...

A shorter direct proof of that result was obtained by Geelen, Gerards, and Whittle [GGW00p]. However, to prove Theorem 7.0.1, the well-quasi-ordering for graphs of bounded tree-width is needed only ...