On spanning trees with few branch vertices

DOI10.1016/J.DISC.2019.06.037MaRDI QIDQ2279263zbMATH OpenOpenAlexWikidataFDO

Authors Warren Shull, Ronald Gould

Publication date 12 December 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2019.06.037

zbMATH Keywords

spanning treesclaw-free graphsbranch vertices

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 7132826
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees with a bounded number of leaves in a claw-free graph.
• Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
• Spanning trees with few leaves in almost claw-free graphs

Cites work

• scientific article; zbMATH DE number 2038756 (Why is no real title available?)
• scientific article; zbMATH DE number 2086635 (Why is no real title available?)
• Degree bounded spanning trees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Independence trees and Hamilton cycles
• Longest paths and cycles in K1,3-free graphs
• Neighborhood unions and extremal spanning trees
• On a k-tree containing specified leaves in a graph
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning spiders and light-splitting switches
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees with a bounded number of leaves in a claw-free graph.
• Spanning trees with bounded degrees
• Spanning trees with few leaves
• Spanning trees: A survey

Cited in

(11)

• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• scientific article; zbMATH DE number 7132826 (Why is no real title available?)
• scientific article; zbMATH DE number 5919760 (Why is no real title available?)
• Spanning Trees with Few Branch Vertices
• Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
• scientific article; zbMATH DE number 2011838 (Why is no real title available?)
• Conditions for spanning trees whose internal subtrees have few branch vertices and leaves
• Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs
• Spanning trees with few peripheral branch vertices in a connected claw-free graph

This page was built for publication: On spanning trees with few branch vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279263)