New lower bound on the number of perfect matchings in fullerene graphs (Q1600673)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New lower bound on the number of perfect matchings in fullerene graphs |
scientific article; zbMATH DE number 1756351
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bound on the number of perfect matchings in fullerene graphs |
scientific article; zbMATH DE number 1756351 |
Statements
New lower bound on the number of perfect matchings in fullerene graphs (English)
0 references
16 June 2002
0 references
fullerene
0 references
Kekule structure
0 references
perfect matching
0 references
bicritical graph
0 references
2-extendable graph
0 references
