Fullerene graphs have exponentially many perfect matchings
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206312" target="_blank" >RIV/00216208:11320/09:00206312 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Fullerene graphs have exponentially many perfect matchings
Original language description
We prove that all fullerene graphs have exponentially many perfect matchings.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Mathematical Chemistry
ISSN
0259-9791
e-ISSN
—
Volume of the periodical
46
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
5
Pages from-to
—
UT code for WoS article
000266926000007
EID of the result in the Scopus database
—