The following pages link to (Q5625199):
Displaying 20 items.
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- Two theorems on Hamiltonian graphs (Q800937) (← links)
- A note on the computation on the k-closure of a graph (Q1108040) (← links)
- Stable properties of graphs (Q1175986) (← links)
- A method in graph theory (Q1227760) (← links)
- Sur les arborescences dans un graphe oriente (Q1229222) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← 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)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- Generalizations of the classics to spanning connectedness (Q2242808) (← links)
- Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs (Q2298039) (← links)
- A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph (Q2413635) (← links)
- Neighborhood unions and extremal spanning trees (Q2427493) (← links)
- Matching and spanning in certain planar graphs (Q3043190) (← 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 at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575) (← links)
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs (Q6619687) (← links)
- Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices (Q6671390) (← links)
