𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs of Non-Crossing Perfect Matchings

✍ Scribed by C. Hernando; F. Hurtado; Marc Noy

Publisher
Springer Japan
Year
2002
Tongue
English
Weight
256 KB
Volume
18
Category
Article
ISSN
0911-0119

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

Z-transformation graphs of perfect match
Z-transformation graphs of perfect matchings of plane bipartite graphs
✍ Heping Zhang; Fuji Zhang; Haiyuan Yao πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 343 KB

Let G be a plane bipartite graph with at least two perfect matchings. The Z-transformation graph, ZF (G), of G with respect to a speciΓΏc set F of faces is deΓΏned as a graph on the perfect matchings of G such that two perfect matchings M1 and M2 are adjacent provided M1 and M2 di er only in a cycle t