Further results on enumeration of perfect matchings of Cartesian product graphs
Counting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximation schemes. Let GG and HH be two graphs. Denote by...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
De Gruyter
2024-09-01
|
| Col·lecció: | Open Mathematics |
| Matèries: | |
| Accés en línia: | https://doi.org/10.1515/math-2024-0060 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|