Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
From MaRDI portal
Publication:641183
DOI10.1016/j.disc.2011.06.025zbMath1235.05033MaRDI QIDQ641183
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
Related Items
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 4 leaves in \(K_{1, 5}\)-free graphs, Spectral radius and spanning trees of graphs, Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs, Spanning 3-ended trees in almost claw-free graphs, Spanning 5-ended trees in \(K_{1,5}\)-free graphs, Spanning trees with few peripheral branch vertices, Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs, Spanning \(k\)-ended trees in quasi-claw-free 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
Cites Work
