Spanning trees with at most k leaves in K₁,4-free graphs

DOI10.1016/J.DISC.2011.06.025MaRDI QIDQ641183zbMATH OpenOpenAlexFDO

Authors 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

\(K_{1, 4}\)-freedegree sumleafspanning \(t\)-ended systemspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs

Cites work

• Graph theory
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning spiders and light-splitting switches
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs

Cited in

(24)

• Spanning trees with at most 3 leaves in \(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
• Spanning trees with leaf distance at least four
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-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 4 leaves in \(K_{1, 5}\)-free graphs
• 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 branch vertices in \(K_{1,4}\)-free graphs
• Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
• Characterizing spanning trees via the size or the spectral radius of graphs
• Spanning subgraphs and spectral radius in graphs
• Spanning trees of \(K_{1,4}\)-free graphs with a bounded number of leaves and branch vertices
• Spanning trees with a bounded number of branch vertices in a \(K_{1,4}\)-free graph
• A spanning tree with at most \(k\) leaves in a \(K_{1,5}\)-free graph
• Spanning trees of claw-free graphs with few leaves and branch vertices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q641183)