The following pages link to Spanning trees: A survey (Q659663):
Displaying 50 items.
- Spanning trees with bounded degrees and leaves (Q271638) (← links)
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- \(m\)-dominating \(k\)-ended trees of graphs (Q400391) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← 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 \(k\)-trees of bipartite graphs (Q490315) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
- Spanning trees homeomorphic to a small tree (Q898126) (← links)
- \(m\)-dominating \(k\)-trees of graphs (Q898133) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Spectra of subdivision-vertex join and subdivision-edge join of two graphs (Q1712764) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← 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)
- Game edge-connectivity of graphs (Q2028096) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- On the Hamiltonian property hierarchy of 3-connected planar graphs (Q2094888) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- Degree sums and spanning brooms of a graph (Q2144512) (← links)
- Spanning trees and spanning closed walks with small degrees (Q2144593) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- The minimum size of a graph with given tree connectivity (Q2227103) (← links)
- On specific factors in graphs (Q2227979) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- A note on the independence number, connectivity and \(k\)-ended tree (Q2235267) (← 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 trees with leaf distance at least \(d\) (Q2400579) (← links)
- Note on the spanning-tree packing number of lexicographic product graphs (Q2514151) (← links)
- Spanning trees with few peripheral branch vertices in a connected claw-free graph (Q2694860) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134) (← links)
- A condition ensuring that a connected graph has a spanning tree with few leaves (Q2699565) (← links)
- Path-connectivity of lexicographic product graphs (Q2804863) (← links)
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
- Counting spanning trees in self-similar networks by evaluating determinants (Q2851758) (← links)
- Degree Conditions for Spanning Brooms (Q2930040) (← links)
- Minimum Degree and Dominating Paths (Q2958208) (← links)
- Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below (Q3186835) (← links)
- Spanning trees whose reducible stems have a few branch vertices (Q4959538) (← links)
- On the Power of Planned Infections in Networks (Q4985791) (← links)
- Spanning k-ended trees of 3-regular connected graphs (Q5006619) (← links)
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)
- Spanning paths and cycles in triangle-free graphs (Q5151426) (← links)
- Spanning trees with small diameters (Q5154596) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575) (← links)
