Perfect matchings on a type of lattices with toroidal boundary
From MaRDI portal
Publication:2422643
DOI10.1007/s11766-019-3502-yzbMath1424.05152OpenAlexW2922246381WikidataQ128219252 ScholiaQ128219252MaRDI QIDQ2422643
Mingzu Zhang, Xing Feng, Lian Zhu Zhang
Publication date: 20 June 2019
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-019-3502-y
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting dimer coverings on self-similar Schreier graphs
- The complexity of computing the permanent
- Graphical condensation of plane graphs: a combinatorial approach
- Matching theory
- Remark on the dimer problem
- Matchings in graphs on non-orientable surfaces
- Graphical condensation for enumerating perfect matchings
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Resonance in elemental benzenoids
- The number of Kekulé structures of polyominos on the torus
- Enumeration of perfect matchings of a type of quadratic lattice on the torus
- Pfaffian orientations and perfect matchings of scale-free networks
- Enumeration of perfect matchings of a type of Cartesian products of graphs
- The statistics of dimers on a lattice
- Dimers on two types of lattices on the Klein bottle
This page was built for publication: Perfect matchings on a type of lattices with toroidal boundary
