Pages that link to "Item:Q1268112"
From MaRDI portal
The following pages link to Maximal trees with bounded maximum degree in a graph (Q1268112):
Displaying 15 items.
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- Maximal flow in branching trees and binary search trees (Q655924) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- A note on trees of maximum weight and restricted degrees (Q1408895) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← links)
- Vertex arboricity and maximum degree (Q1894756) (← links)
- Maximum trees of finite sequences (Q1904988) (← links)
- Number of vertices of degree three in spanning 3-trees in square graphs (Q2009592) (← links)
- Closure and spanning trees with bounded total excess (Q2045377) (← links)
- Maximum number of subtrees in cacti and block graphs (Q2172841) (← links)
- Neighborhood unions and extremal spanning trees (Q2427493) (← links)
- Two trees in maximal planar bipartite graphs (Q4285595) (← links)
- Reducing the maximum degree of a graph by deleting vertices: the extremal cases (Q5225550) (← links)
- (Q5294907) (← links)