Spanning \(k\)-ended trees in quasi-claw-free graphs
From MaRDI portal
Publication:2302022
DOI10.1007/s40840-018-0677-yzbMath1433.05172OpenAlexW2893086734WikidataQ129246813 ScholiaQ129246813MaRDI QIDQ2302022
Huiqing Liu, Fuliang Lu, Mingda Liu, Xiao Dong Chen
Publication date: 25 February 2020
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-018-0677-y
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
- Degree bounded spanning trees
- Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
- Spanning trees whose stems have a bounded number of branch vertices
- 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
- Quasi-claw-free graphs
- A note on a spanning 3-tree
- Spanning trees in 3-connected K3,t-minor-free graphs
- Independence trees and Hamilton cycles
This page was built for publication: Spanning \(k\)-ended trees in quasi-claw-free graphs