Abstract
AbstractLet 𝒯 be the class of unlabeled trees. An unlabeled vertex‐deleted subgraph of a tree T is called a card. A collection of cards is called a deck. We say that the tree T has a deck D if each card in D can be obtained by deleting distinct vertices of T. If T is the only unlabeled tree that has the deck D, we say that T is 𝒯‐reconstructible from D. We want to know how large of a deck D is necessary for T to be 𝒯‐reconstructible. We define 𝒯rn(T) as the minimum number of cards in a deck D such that T is 𝒯‐reconstructible from D. It is known that 𝒯rn(T)≤3, but it is conjectured that 𝒯rn(T)≤2 for all trees T. We prove that the conjecture holds for all homeomorphically irreducible trees. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 243–257, 2010
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.
