Abstract
Edge disjoint realization problems have connections for example to discrete tomography. In this paper, we consider the edge disjoint caterpillar realizations of tree degree sequences. We give necessary and sufficient conditions when two tree degree sequences have edge disjoint caterpillar realizations. We conjecture that an arbitrary number of tree degree sequences have edge disjoint realizations if every vertex is a leaf in at most one tree. We prove that the conjecture is true if the number of tree degree sequences is at most four. We also prove that the conjecture is true if n≥max{22k−11,396}, where n is the number of vertices and k is the number of tree degree sequences.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
