Edge disjoint realization problems have connections for example to discrete tomography. In this paper, we consider the edge caterpillar realizations of tree degree sequences. We give necessary and sufficient conditions when two sequences realizations. conjecture that an arbitrary number if every vertex is a leaf in at most one tree. prove true four. also n ≥ max { 22 k − 11 , 396 } where vertices
