Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs

DOI10.1016/J.DISC.2011.06.025zbMath1235.05033OpenAlexW1992714766MaRDI QIDQ641183

Aung Kyaw

Publication date: 21 October 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

spanning treedegree sumleaf\(K_{1, 4}\)-freespanning \(t\)-ended system

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (14)

Spectral radius and spanning trees of graphs ⋮ A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs ⋮ Spanning 3-ended trees in almost claw-free graphs ⋮ Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ Spanning trees with few peripheral branch vertices ⋮ Spanning 5-ended trees in \(K_{1,5}\)-free graphs ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning trees whose reducible stems have a few branch vertices ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs

Cites Work

• Unnamed Item
• 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
• Spanning spiders and light-splitting switches

This page was built for publication: Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs