𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random Lifts Of Graphs: Perfect Matchings

✍ Scribed by Nathan Linial*; Eyal Rozenman

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
265 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with independent perfect matching
Graphs with independent perfect matchings
✍ Marcelo H. de Carvalho; ClΓ‘udio L. Lucchesi; U. S. R. Murty πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 241 KB

A graph with at least two vertices is matching covered if it is connected and each edge lies in some perfect matching. A matching covered graph G is extremal if the number of perfect matchings of G is equal to the dimension of the lattice spanned by the set of incidence

Graphs of Non-Crossing Perfect Matchings
Graphs of Non-Crossing Perfect Matchings
✍ C. Hernando; F. Hurtado; Marc Noy πŸ“‚ Article πŸ“… 2002 πŸ› Springer Japan 🌐 English βš– 256 KB