Pages that link to "Item:Q1180410"
From MaRDI portal
The following pages link to Spanning trees with bounded degrees (Q1180410):
Displaying 42 items.
- Spanning trees with bounded degrees and leaves (Q271638) (← links)
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph (Q354444) (← links)
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- Spanning \(k\)-trees of bipartite graphs (Q490315) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- Degree bounded spanning trees (Q605003) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning \(k\)-trees of \(n\)-connected graphs (Q659713) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Closure and spanning \(k\)-trees (Q742606) (← links)
- On a \(k\)-tree containing specified leaves in a graph (Q855299) (← links)
- \(m\)-dominating \(k\)-trees of graphs (Q898133) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- A note on matchings and spanning trees with bounded degrees (Q1359373) (← links)
- Independence number and \(k\)-trees of graphs (Q1684925) (← links)
- Snarks with special spanning trees (Q1733867) (← links)
- Near-optimal bounded-degree spanning trees (Q1840509) (← links)
- An extension of the Win theorem: counting the number of maximum independent sets (Q2002161) (← links)
- Number of vertices of degree three in spanning 3-trees in square graphs (Q2009592) (← links)
- A note on a spanning 3-tree (Q2149492) (← links)
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) (Q2259579) (← links)
- On spanning trees with few branch vertices (Q2279263) (← links)
- Spanning trees and spanning Eulerian subgraphs with small degrees (Q2342618) (← links)
- An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets (Q2354602) (← links)
- Neighborhood unions and extremal spanning trees (Q2427493) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- The independence number condition for the existence of a spanning f-tree (Q3069673) (← links)
- Independence trees and Hamilton cycles (Q4242952) (← links)
- On low bound of degree sequences of spanning trees inK-edge-connected graphs (Q4242971) (← links)
- Independence number and degree bounded spanning tree (Q4670065) (← links)
- Small degree out‐branchings (Q4805223) (← links)
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios (Q5146820) (← links)
- Spanning k-tree with specified vertices (Q5197548) (← links)
- On the largest tree of given maximum degree in a connected graph (Q5202199) (← links)
- (Q5294907) (← links)
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces (Q5300503) (← links)
- Chvátal–Erdős Theorem: Old Theorem with New Aspects (Q5302754) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- Spanning trees of bounded degree (Q5947942) (← links)
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs (Q6204344) (← links)
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs (Q6611082) (← links)
- Characterizing spanning trees via the size or the spectral radius of graphs (Q6657283) (← links)
