Spanning trees with at most 6 leaves in K₁,5-free graphs
From MaRDI portal
Publication:2298039
Summary: A graph \(G\) is called \(K_{1,5}\)-free if \(G\) contains no \(K_{1,5}\) as an induced subgraph. A tree with at most \(m\) leaves is called an \(m\)-ended tree. Let \(\sigma_k \left(G\right)\) be the minimum degree sum of \(k\) independent vertices in \(G\). In this paper, it is shown that every connected \(K_{1,5}\)-free graph \(G\) contains a spanning 6-ended tree if \(\sigma_7 \left(G\right) \geq |G|- 2\).
Recommendations
- 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 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 trees with at most 3 leaves in \(K_{1,4}\)-free graphs
Cites work
- Graph theory with applications
- scientific article; zbMATH DE number 3349867 (Why is no real title available?)
- Independence trees and Hamilton cycles
- On a conjecture of Las Vergnas concerning certain spanning trees in graphs
- Spanning spiders and light-splitting switches
- Spanning trees with a bounded number of leaves in a claw-free graph.
- Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
- Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
- Spanning trees: A survey
Cited in
(9)- Spanning 5-ended trees in \(K_{1,5}\)-free graphs
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6
- scientific article; zbMATH DE number 3948324 (Why is no real title available?)
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
- 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
- A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
- A spanning tree with at most \(k\) leaves in a \(K_{1,5}\)-free graph
This page was built for publication: Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298039)
