Spanning trees with bounded degrees
From MaRDI portal
Recommendations
Cites work
Cited in
(47)- Degree-bounded minimum spanning trees
- A note on matchings and spanning trees with bounded degrees
- Independence number and \(k\)-trees of graphs
- Snarks with special spanning trees
- Near-optimal bounded-degree spanning trees
- An extension of the Win theorem: counting the number of maximum independent sets
- Number of vertices of degree three in spanning 3-trees in square graphs
- A note on a spanning 3-tree
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
- On spanning trees with few branch vertices
- Spanning trees and spanning Eulerian subgraphs with small degrees
- An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets
- Neighborhood unions and extremal spanning trees
- Spanning trees with bounded degrees and leaves
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- The independence number condition for the existence of a spanning f-tree
- scientific article; zbMATH DE number 434863 (Why is no real title available?)
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Spanning \(k\)-ended trees of bipartite graphs
- Independence trees and Hamilton cycles
- scientific article; zbMATH DE number 2157456 (Why is no real title available?)
- Small degree out‐branchings
- Spanning \(k\)-trees of bipartite graphs
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
- Spanning k-tree with specified vertices
- On the largest tree of given maximum degree in a connected graph
- scientific article; zbMATH DE number 5174840 (Why is no real title available?)
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
- Chvátal–Erdős Theorem: Old Theorem with New Aspects
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Spanning trees of bounded degree
- A \(k\)-tree containing specified vertices
- Degree bounded spanning trees
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
- Spanning trees: A survey
- Spanning \(k\)-trees of \(n\)-connected graphs
- Spanning k-trees and distance signless Laplacian spectral radius of graphs
- Characterizing spanning trees via the size or the spectral radius of graphs
- Eigenvalues and spanning tree in regular graphs
- Spanning trees with few branch vertices in a chair-free graph. Independence number and degree sum conditions
- Tight conditions for spanning trees with leaf degree at most k in graphs
- Sufficient conditions for k-factors and spanning trees of graphs
- Sufficient conditions for k-factor-critical graphs and spanning k-trees of graphs
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- Closure and spanning \(k\)-trees
- On a k-tree containing specified leaves in a graph
- \(m\)-dominating \(k\)-trees of graphs
This page was built for publication: Spanning trees with bounded degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180410)
