The following pages link to (Q5080912):
Displaying 8 items.
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- Minimum degree and minimum number of edge-disjoint trees (Q1420598) (← links)
- Minimum monopoly in regular and tree graphs (Q2497525) (← links)
- On the minimum number of components in a cotree of a graph (Q2702779) (← links)
- On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (Q2978176) (← links)
- (Q4033014) (← links)
- Exactly \(k\) MSTs: How many vertices suffice? (Q6606169) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)