𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Topics in Combinatorics and Graph Theory || Counting Perfect Matchings in Lattice Graphs

✍ Scribed by Bodendiek, Rainer; Henn, Rudolf

Book ID
120208380
Publisher
Physica-Verlag HD
Year
1990
Weight
587 KB
Category
Article
ISBN
3642469086

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combinatorics of perfect matchings in pl
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
✍ J.C. Fournier πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 737 KB

Let G be a plane bipartite graph which admits a perfect matching and with distinguished faces called holes. Let MG denote the perfect matchings graph: its vertices are the perfect matchings of G, two of them being joined by an edge, if and only if they di er only on an alternating cycle bounding a f

Perfect matchings and ears in elementary
Perfect matchings and ears in elementary bipartite graphs
✍ Pierre Hansen; Fuji Zhang; Maolin Zheng πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 386 KB

We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph. An application to chemical graphs is also discussed. In addition, a method to construct all minimal elementary bipartite graphs is described.

[Network Theory and Applications] Matric
[Network Theory and Applications] Matrices in Combinatorics and Graph Theory Volume 3 || Appendix
✍ Liu, Bolian; Lai, Hong-Jian πŸ“‚ Article πŸ“… 2000 πŸ› Springer US 🌐 English βš– 735 KB

Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. This relationship is discussed in my paper The symbiotic relationship of combinatorics and matrix theoryl where I attempted to justify this description. One could say that a more detailed justification was given