Maximal trees with bounded maximum degree in a graph
From MaRDI portal
Recommendations
- On the largest tree of given maximum degree in a connected graph
- scientific article; zbMATH DE number 5174840
- Maximum induced trees in graphs
- scientific article; zbMATH DE number 5811345
- scientific article; zbMATH DE number 932184
- On trees of bounded degree with maximal number of greatest independent sets
- The maximum degree in a random tree and related problems
- Maximum induced forests in graphs of bounded treewidth
- A note on trees of maximum weight and restricted degrees
Cited in
(16)- Closure and spanning trees with bounded total excess
- Neighborhood unions and extremal spanning trees
- Maximum trees of finite sequences
- Reducing the maximum degree of a graph by deleting vertices
- Trees with maximum number of maximal matchings
- Spanning trees: A survey
- Number of vertices of degree three in spanning 3-trees in square graphs
- A note on trees of maximum weight and restricted degrees
- Maximum number of subtrees in cacti and block graphs
- Vertex arboricity and maximum degree
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs
- Maximal flow in branching trees and binary search trees
- Reducing the maximum degree of a graph by deleting vertices: the extremal cases
- Spanning spiders and light-splitting switches
- Two trees in maximal planar bipartite graphs
- scientific article; zbMATH DE number 5174840 (Why is no real title available?)
This page was built for publication: Maximal trees with bounded maximum degree in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268112)
