Maximizing spanning trees in almost complete graphs

DOI10.1002/(SICI)1097-0037(199708)30:1%3C23::AID-NET3%3E3.0.CO;2-NzbMATH Open0882.05051OpenAlexW2089018301MaRDI QIDQ4355482FDOQ4355482

Authors Bryan Gilbert, Wendy Myrvold 

Publication date 21 September 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199708)30:1%3C23::aid-net3%3E3.0.co;2-n

zbMATH Keywords

spanning treespathscharacterizationcyclesfinite graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Maximizing spanning trees in almost complete graphs
• Maximizing the Number of Spanning Trees in a Connected Graph
• On the approximability of some maximum spanning tree problems
• On the approximability of some Maximum Spanning Tree Problems
• scientific article; zbMATH DE number 932184
• A greedy algorithm for finding maximum spanning trees in infinite graphs
• The maximum \(f\)-depth spanning tree problem
• Heuristic maximization of the number of spanning trees in regular graphs
• On finding a maximum spanning tree of bounded radius
• On the characterization of graphs with maximum number of spanning trees

Cited In (18)

• Title not available (Why is no real title available?)
• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• A generalization of Boesch's theorem
• Spanning trees: A survey
• Heuristic maximization of the number of spanning trees in regular graphs
• A survey of some network reliability analysis and synthesis results
• A new technique for the characterization of graphs with a maximum number of spanning trees
• Exactly \(k\) MSTs: How many vertices suffice?
• Max-stretch reduction for tree spanners
• Title not available (Why is no real title available?)
• The number of spanning trees in \(K_n\)-complement of a bipartite graph
• Title not available (Why is no real title available?)
• Maximizing the number of spanning trees of networks based on cycle basis representation
• Extremal graphs for the Tutte polynomial
• The maximum \(f\)-depth spanning tree problem
• On the set of extreme core allocations for minimal cost spanning tree problems
• Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
• A limit characterization for the number of spanning trees of graphs

This page was built for publication: Maximizing spanning trees in almost complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355482)