Maximizing spanning trees in almost complete graphs
From MaRDI portal
Publication:4355482
DOI<23::AID-NET3>3.0.CO;2-N 10.1002/(SICI)1097-0037(199708)30:1<23::AID-NET3>3.0.CO;2-NzbMath0882.05051OpenAlexW2089018301MaRDI QIDQ4355482
Bryan Gilbert, Wendy J. Myrvold
Publication date: 21 September 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199708)30:1<23::aid-net3>3.0.co;2-n
Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Related Items (8)
Heuristic maximization of the number of spanning trees in regular graphs ⋮ A limit characterization for the number of spanning trees of graphs ⋮ Extremal graphs for the Tutte polynomial ⋮ A generalization of Boesch's theorem ⋮ Spanning trees: A survey ⋮ A survey of some network reliability analysis and synthesis results ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ Unnamed Item
This page was built for publication: Maximizing spanning trees in almost complete graphs
