Disjoint Representation of Three Tree Realizable Sequences. I
Sukhamay Kundu · SIAM Journal on Applied Mathematics · 1975
In this paper we provide a simple sufficient condition for the existence of an edge-disjoint packing in a graph for three trees of specified degree sequence. The condition is similar to the one given earlier for packing of two trees of specified degree sequence. The proof of the main theorem is by giving a procedure for constructing the packing.