The following pages link to Spanning trees with many leaves (Q5890331):
Displaying 50 items.
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs (Q512550) (← links)
- Some results on spanning trees (Q601948) (← links)
- The edge-density for \(K_{2,t}\) minors (Q618032) (← links)
- On graphs with few disjoint \(t\)-star minors (Q648995) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553) (← links)
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Spanning trees whose stems are spiders (Q897247) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213) (← links)
- Bounds of the number of leaves of spanning trees (Q1930214) (← links)
- Edge tree spanners (Q2056906) (← links)
- Degree powers in \(K_{s,t}\)-minor free graphs (Q2075529) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait (Q2171018) (← links)
- Tree-width and planar minors (Q2259855) (← links)
- Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052) (← links)
- The spectral radius of graphs with no \(k_{2,t}\) minor (Q2402469) (← links)
- Neighborhood unions and extremal spanning trees (Q2427493) (← links)
- On spanning cycles, paths and trees (Q2446869) (← links)
- Spanning trees with few leaves (Q2464051) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Minimum degree, leaf number and traceability (Q2864428) (← links)
- Balancing two spanning trees (Q3087621) (← links)
- Connected Domination (Q3384607) (← links)
- Spanning trees with leaf distance at least four (Q3445504) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- Spanning trees with a bounded number of leaves (Q4690981) (← links)
- On the signless Laplacian spectral radius of <i>K<sub>s,t</sub></i>-minor free graphs (Q4959299) (← links)
- (Q4982929) (← links)
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)
- Lower bounds on the leaf number in graphs with forbidden subgraphs (Q5236058) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- Spanning trees with many leaves (Q5919174) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs (Q6204344) (← links)
- The burning number conjecture is true for trees without degree-2 vertices (Q6581897) (← links)
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs (Q6611082) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)
- Characterizing spanning trees via the size or the spectral radius of graphs (Q6657283) (← links)
