Perfect matchings on a type of lattices with toroidal boundary
DOI10.1007/S11766-019-3502-YzbMATH Open1424.05152OpenAlexW2922246381WikidataQ128219252 ScholiaQ128219252MaRDI QIDQ2422643FDOQ2422643
Authors: Xing Feng, Mingzu Zhang, Lianzhu 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
Recommendations
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- The complexity of computing the permanent
- Remark on the dimer problem
- Dimers on two types of lattices on the Klein bottle
- 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
- Title not available (Why is that?)
- Matchings in graphs on non-orientable surfaces
- Pfaffian orientations and perfect matchings of scale-free networks
- Graphical condensation for enumerating perfect matchings
- Graphical condensation of plane graphs: a combinatorial approach
- Enumeration of perfect matchings of a type of Cartesian products of graphs
- Counting dimer coverings on self-similar Schreier graphs
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Perfect matchings on a type of lattices with toroidal boundary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422643)
