Pages that link to "Item:Q4355482"
From MaRDI portal
The following pages link to Maximizing spanning trees in almost complete graphs (Q4355482):
Displayed 8 items.
- A generalization of Boesch's theorem (Q409456) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Heuristic maximization of the number of spanning trees in regular graphs (Q855940) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- A limit characterization for the number of spanning trees of graphs (Q2390271) (← links)
- Extremal graphs for the Tutte polynomial (Q2664552) (← links)
- A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
- (Q5708545) (← links)