Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
From MaRDI portal
Publication:2698134
DOI10.1016/j.amc.2023.127842OpenAlexW4317810520MaRDI QIDQ2698134
Yuan Chen, Shunzhe Zhang, Guantao Chen, Zhi-quan Hu
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2023.127842
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Cites Work
- 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: A survey
- Hamilton connected graphs
- On a conjecture of Las Vergnas concerning certain spanning trees in graphs
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs
- A note on Hamiltonian circuits
- Independence trees and Hamilton cycles
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
This page was built for publication: Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
