Before revision:  Our structural result settles numerous questions including the complexity of the problem of counting subdivision trees that was left open in the paper of Francis and Steel, and also provides short proofs of different known results from a unifying point of view. The results in this paper still hold for a certain class of non-binary networks.
After revision:  Importantly, the results and algorithms in this paper still hold for a certain class of non-binary networks.