Spanning trees with at most 6 leaves in K₁,5-free graphs
From MaRDI portal
Publication:2298039
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
- scientific article; zbMATH DE number 3349867 (Why is no real title available?)
- Graph theory with applications
- 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
(8)- scientific article; zbMATH DE number 3948324 (Why is no real title available?)
- A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph
- 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 5-ended trees in \(K_{1,5}\)-free graphs
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
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)
