𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A honeycomb graph perfect matchings enumeration

✍ Scribed by M. Desainte-Catherine


Book ID
105102303
Publisher
Springer
Year
1993
Tongue
English
Weight
518 KB
Volume
13
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Perfect matchings of a graph
✍ Ian Anderson πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 179 KB
Enumeration of Perfect Matchings in Grap
✍ Mihai Ciucu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 759 KB

A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of matchings of two subgraphs. When the graph is also centr

Enumerating Perfect Matchings inn-Cubes
✍ Patric R. J. Γ–stergΓ₯rd, Ville H. Pettersson πŸ“‚ Article πŸ“… 2012 πŸ› Springer Netherlands 🌐 English βš– 323 KB
On the Number of Perfect Matchings in a
✍ de Carvalho, Marcelo H.; Lucchesi, ClΓ‘udio L.; Murty, U. S. R. πŸ“‚ Article πŸ“… 2013 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 471 KB