Abstract
Many proofs in graph theory use (spanning) trees which preserve a certain property of the graph. We discuss some recent results on spanning trees with the same shape (more precisely, the same end structure) as the graph and on transient subtrees. A general sufficient condition, in terms of isoperimetric inequalities, for a transient subtree is presented.
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.
