Pages that link to "Item:Q1045112"
From MaRDI portal
The following pages link to Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (Q1045112):
Displaying 20 items.
- Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs (Q477134) (← links)
- Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (Q641183) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning trees whose stems have a bounded number of branch vertices (Q726654) (← links)
- Spanning trees whose stems are spiders (Q897247) (← links)
- Spanning 3-ended trees in almost claw-free graphs (Q1723356) (← links)
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs (Q1988569) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs (Q2298039) (← links)
- Spanning \(k\)-ended trees in quasi-claw-free graphs (Q2302022) (← links)
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
- Spanning trees with few peripheral branch vertices in a connected claw-free graph (Q2694860) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
- Spanning trees whose reducible stems have a few branch vertices (Q4959538) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5918150) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575) (← links)
- Spectral radius and spanning trees of graphs (Q6041529) (← links)
- A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph (Q6117248) (← links)
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs (Q6204344) (← links)