On the number of perfect matchings in random polygonal chains
From MaRDI portal
Publication:6611494
DOI10.1515/MATH-2023-0146zbMATH Open1547.05244MaRDI QIDQ6611494
Xiaoling Ke, Shou Liu Wei, Jianwu Huang, Yong-De Feng
Publication date: 26 September 2024
Published in: Open Mathematics (Search for Journal in Brave)
Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect matchings in random polyomino chain graphs
- Distance-based topological indices of the tree-like polyphenyl systems
- Kekulé structures of square-hexagonal chains and the Hosoya index of caterpillar trees
- Matching theory
- Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons
- Matching theory -- a sampler: From Dénes König to the present
- \(k\)-cycle resonant graphs
- Perfect matchings in random pentagonal chains
- The number of Kekulé structures of polyominos on the torus
- Perfect matchings in random octagonal chain graphs
- A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- The Complexity of Enumeration and Reliability Problems
This page was built for publication: On the number of perfect matchings in random polygonal chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611494)