Abstract
AbstractFor an integer , a ‐tree is a tree with maximum degree at most . More generally, if is an integer‐valued function on vertices, an ‐tree is a tree in which each vertex has degree at most . Let denote the number of components of a graph . We show that if is a connected ‐minor‐free graph and then has a spanning ‐tree. Consequently, if is a ‐tough ‐minor‐free graph, then has a spanning ‐tree. These results are stronger than results for general graphs due to Win (for ‐trees) and Ellingham, Nam, and Voss (for ‐trees). The ‐minor‐free graphs form a subclass of planar graphs, and are identical to graphs of treewidth at most 2, and also to graphs whose blocks are series‐parallel. We provide examples to show that the inequality above cannot be relaxed by adding 1 to the right‐hand side, and also to show that our result does not hold for general planar graphs. Our proof uses a technique where we incorporate toughness‐related information into weights associated with vertices and cutsets.
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.
