On lower bounds of number of perfect matchings in fullerene graphs
type: Item
instance of: scholarly article
title: On lower bounds of number of perfect matchings in fullerene graphs
zbMATH Open document ID: 0918.92025
DOI: 10.1023/A:1019195324778
author: Tomislav Došlić
publication date: 1999-07-07T00:00:00Z
Mathematics Subject Classification ID: 92E10
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1251552
zbMATH Keywords: decomposition
zbMATH Keywords: perfect matchings
zbMATH Keywords: fullerene graph
MaRDI profile type: Publication
full work available at URL: a:1019195324778
OpenAlex ID: W187862351
published in: Journal of Mathematical Chemistry
Recommended article: New lower bound on the number of perfect matchings in fullerene graphs
Recommended article: Fullerene graphs with exponentially many perfect matchings
Recommended article: Forcing matching numbers of fullerene graphs
Recommended article: Matchings in m-generalized fullerene graphs
Recommended article: Fullerene graphs have exponentially many perfect matchings
Recommended article: Shortest perfect pseudomatchings in fullerene graphs
Recommended article: Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
Recommended article: Q5005694
Recommended article: On forcing matching number of boron-nitrogen fullerene graphs
Recommended article: On the upper bounds of the numbers of perfect matchings in graphs with given parameters
description: scientific article; zbMATH DE number 1251552