𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph

✍ Scribed by Peter Che Bor Lam; Heping Zhang

Book ID
111542615
Publisher
Springer Netherlands
Year
2003
Tongue
English
Weight
176 KB
Volume
20
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Number of Perfect Matchings in a
On the Number of Perfect Matchings in a Bipartite Graph
✍ de Carvalho, Marcelo H.; Lucchesi, ClΓ‘udio L.; Murty, U. S. R. πŸ“‚ Article πŸ“… 2013 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 471 KB
The rotation graphs of perfect matchings
The rotation graphs of perfect matchings of plane bipartite graphs
✍ Heping Zhang; Fuji Zhang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 517 KB

In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for generalized polyhex graphs to arbitrary plane

A note on the number of perfect matching
A note on the number of perfect matchings of bipartite graphs
✍ Zhang Fuji; Zhang Heping πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv