Pages that link to "Item:Q4242952"
From MaRDI portal
The following pages link to Independence trees and Hamilton cycles (Q4242952):
Displaying 35 items.
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- Spanning trees with small degrees and few leaves (Q452956) (← links)
- Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs (Q477134) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning \(k\)-trees of \(n\)-connected graphs (Q659713) (← links)
- On 3-stable number conditions in \(n\)-connected claw-free graphs (Q724867) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Spanning trees homeomorphic to a small tree (Q898126) (← links)
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices (Q1025545) (← links)
- A note on computing graph closures (Q1422436) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Degree conditions for graphs to have spanning trees with few branch vertices and leaves (Q1733871) (← links)
- Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves (Q1988553) (← links)
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs (Q1988569) (← links)
- Number of vertices of degree three in spanning 3-trees in square graphs (Q2009592) (← links)
- Closure and spanning trees with bounded total excess (Q2045377) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- A note on spanning trees with a specified degree sequence (Q2188994) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- On spanning trees with few branch vertices (Q2279263) (← 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)
- A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph (Q2413635) (← links)
- Spanning trees with few leaves (Q2464051) (← links)
- On a spanning tree with specified leaves (Q2482350) (← links)
- Spanning trees with few peripheral branch vertices in a connected claw-free graph (Q2694860) (← links)
- Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134) (← links)
- Spanning trees with a bounded number of leaves (Q4690981) (← links)
- Spanning trees whose reducible stems have a few branch vertices (Q4959538) (← links)
- Spanning k-ended trees of 3-regular connected graphs (Q5006619) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← 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)
- Progress on sufficient conditions for a graph to have a spanning \(k\)-ended tree (Q6148895) (← links)
