Graphs generally and networks in particular are dealt with directly below. Trees are dealt with separately in sections 19.2 Trees and 19.3 Another Tree Notation . 87 Charts , which typically plot data ...

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 ...