𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matching-perfect and cover-perfect graphs

✍ Scribed by Mordechai Lewin

Book ID
112885451
Publisher
The Hebrew University Magnes Press
Year
1974
Tongue
English
Weight
125 KB
Volume
18
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Perfect matchings of a graph
Perfect matchings of a graph
✍ Ian Anderson πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 179 KB
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