Spanning trees with at most 6 leaves in K₁,5-free graphs
From MaRDI portal
Publication:2298039
DOI10.1155/2019/1348348zbMATH Open1435.05168OpenAlexW2977359852MaRDI QIDQ2298039FDOQ2298039
Authors: Yanyan Li 
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/1348348
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
Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory with applications
- On a conjecture of Las Vergnas concerning certain spanning trees in graphs
- Spanning trees: A survey
- Independence trees and Hamilton cycles
- Title not available (Why is that?)
- Spanning trees with at most 3 leaves in \(K_{1,4}\)-free 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 \(k\) leaves in \(K_{1,4}\)-free graphs
Cited In (7)
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
- Title not available (Why is that?)
- 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
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6
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)
