𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum matchings in bipartite graphs via strong spanning trees

✍ Scribed by M. L. Balinski; J. Gonzalez

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
692 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the asymptotic behavior of the maximu
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
✍ Lonc, Zbigniew; Parol, Krzysztof; Wojciechowski, Jacek M. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 3 views

The following asymptotic estimation of the maximum number of spanning trees f k (n) in 2kregular circulant graphs ( k ΓΊ 1) on n vertices is the main result of this paper: )) , where

On numbers of vertices of maximum degree
On numbers of vertices of maximum degree in the spanning trees of a graph
✍ Jerzy Topp; Preben D. Vestergaard πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it