Spanning 3-ended trees in almost claw-free graphs

DOI10.1155/2015/476182zbMath1418.05049OpenAlexW2278904241WikidataQ59105929 ScholiaQ59105929MaRDI QIDQ1723356

Meijin Xu, Xiao Dong Chen, Yan-Jun Liu

Publication date: 19 February 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/476182

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Hamilton connected graphs
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
• Almost claw‐free graphs
• Hamiltonicity for K_{1, r}‐free graphs
• Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms

This page was built for publication: Spanning 3-ended trees in almost claw-free graphs