New lower bound on the number of perfect matchings in fullerene graphs (Q1600673): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:35, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bound on the number of perfect matchings in fullerene graphs |
scientific article |
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
