Fullerene graphs with exponentially many perfect matchings
From MaRDI portal
Publication:1025756
DOI10.1007/s10910-006-9068-yzbMath1175.05109OpenAlexW2068905520MaRDI QIDQ1025756
Publication date: 23 June 2009
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-006-9068-y
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (12)
Nice pairs of odd cycles in fullerene graphs ⋮ Finding more perfect matchings in leapfrog fullerenes ⋮ Fullerene graphs have exponentially many perfect matchings ⋮ Polyhedral graphs via their automorphism groups ⋮ On the automorphism group of polyhedral graphs ⋮ Leapfrog fullerenes have many perfect matchings ⋮ On cyclic edge-connectivity of fullerenes ⋮ Counting perfect matchings in \(n\)-extendable graphs ⋮ Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems ⋮ On Certain Graph Theory Applications ⋮ A mathematical programming model for computing the fries number of a fullerene ⋮ Packing resonant hexagons in fullerenes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of Kekulé structures in capped zigzag nanotubes
- On lower bounds of number of perfect matchings in fullerene graphs
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- New lower bound on the number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- Perfect matchings in bipartite lattice animals: lower bounds and realizability
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
This page was built for publication: Fullerene graphs with exponentially many perfect matchings
