Pages that link to "Item:Q4355482"
From MaRDI portal
The following pages link to Maximizing spanning trees in almost complete graphs (Q4355482):
Displaying 21 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 new technique for the characterization of graphs with a maximum number of spanning trees (Q1349105) (← links)
- On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- A limit characterization for the number of spanning trees of graphs (Q2390271) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- Extremal graphs for the Tutte polynomial (Q2664552) (← links)
- A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
- (Q3581682) (← links)
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs (Q3642863) (← links)
- (Q3801573) (← links)
- Maximizing spanning trees in almost complete graphs (Q4361180) (← links)
- Maximizing the number of spanning trees of networks based on cycle basis representation (Q4731203) (← links)
- On graphs with the maximum number of spanning trees (Q4894608) (← links)
- (Q5708545) (← links)
- Exactly \(k\) MSTs: How many vertices suffice? (Q6606169) (← links)
- The number of spanning trees in \(K_n\)-complement of a bipartite graph (Q6618161) (← links)
