Spanning trees with few leaves in almost claw-free graphs
From MaRDI portal
Publication:5277014
Recommendations
Cited in
(10)- Spanning 3-ended trees in almost claw-free graphs
- Depth first search in claw-free graphs
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
- The existence of spanning ended system on claw-free graphs
- Spanning \(k\)-ended trees of a claw-free graph
- Spanning \(3\)-ended trees in quasi-claw-free graphs.
- On spanning trees with few branch vertices
- Spanning k-ended trees in quasi-claw-free graphs
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- Spanning trees with a bounded number of leaves in a claw-free graph.
This page was built for publication: Spanning trees with few leaves in almost claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277014)