New lower bound on the number of perfect matchings in fullerene graphs
From MaRDI portal
Publication:1600673
DOI10.1023/A:1015131912706zbMATH Open1003.92039MaRDI QIDQ1600673FDOQ1600673
Authors: Heping Zhang, Fuji Zhang 
Publication date: 16 June 2002
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Recommendations
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cited In (40)
- The lower bound of Kekulé count of fullerenes
- Nice pairs of disjoint pentagons in fullerene graphs
- Nice pairs of odd cycles in fullerene graphs
- Packing stars in fullerenes
- Title not available (Why is that?)
- A note on the cyclical edge-connectivity of fullerene graphs
- Fullerene graphs with exponentially many perfect matchings
- Finding more perfect matchings in leapfrog fullerenes
- Leapfrog fullerenes have many perfect matchings
- Long cycles in fullerene graphs
- Nice pairs of pentagons in chamfered fullerenes
- The anti-Kekulé number of graphs
- A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs
- Cyclic edge-cuts in fullerene graphs
- On cyclic edge-connectivity of fullerenes
- On bicriticality of (3,6)-fullerene graphs
- 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes
- On some structural properties of generalized fullerene graphs with 13 pentagonal faces
- Fullerene graphs have exponentially many perfect matchings
- The fullerene graphs with a perfect star packing
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
- Forcing matching numbers of fullerene graphs
- 2-resonant fullerenes
- On lower bounds of number of perfect matchings in fullerene graphs
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs
- On decompositions of leapfrog fullerenes
- Fullerenes with the maximum Clar number
- Title not available (Why is that?)
- On the number of perfect star packing and perfect pseudo matching in some fullerene graphs
- Distance-restricted matching extendability of fullerene graphs
- Matchings in \(m\)-generalized fullerene graphs
- Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
- Shortest perfect pseudomatchings in fullerene graphs
- The isolated-pentagon rule and nice substructures in fullerenes
- Restricted 2-extendability of (3,6)-fullerenes
- Saturation number of fullerene graphs
- On Certain Graph Theory Applications
- Title not available (Why is that?)
- A lower bound on the number of perfect matchings in benzenoid systems
This page was built for publication: New lower bound on the number of perfect matchings in fullerene graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600673)
