On classification of dichotomously propagating (bifurcating) processes

Dichotomously propagating  (bifurcating) processes can't be classified unambiguously. This does not, however, only concern this kind of process, but moreover all kinds of processes (ie, processes in some generic sense). The reason is that kinds of processes actually are classes (of processes), and classification of classes is ultimately contradictory, since classification is orthogonal. 

It means that kinds of processes are inconsistent (ie, contradictory) entities, and thus that classification into such entities is infinitely recursive. There simply is no consistent solution to any such classification.

This fact may appear counter-intuitive to some of us, but this appearance is only due to that those of us are not aware of that typification is classification. Those of us simply classify (ie, typify) without being aware of that it is what they do. Also illustrating a dichotomously propagating (bifurcating) process with a line graph is typification, since such graphs is a class. Understanding such illustrations consistently is a science on its own (ie, graph theory in mathematics), see "Are node-based and stem-based clades equivalent? Insights from graph theory" by Jeremy Martin et al. 2011.