At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F21%3A43958633" target="_blank" >RIV/49777513:23520/21:43958633 - isvavai.cz</a>
Result on the web
<a href="https://onlinelibrary.wiley.com/doi/10.1002/jgt.22660" target="_blank" >https://onlinelibrary.wiley.com/doi/10.1002/jgt.22660</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.22660" target="_blank" >10.1002/jgt.22660</a>

Result language
angličtina
Original language name
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
Original language description
A fullerene graph is a 3-connected cubic planar graph with pentagonal and hexagonal faces. The leapfrog transformation of a planar graph produces the trucation of the dual of the given graph. A fullerene graph is leapfrog if it can be obtained from another fullerene graph by the leapfrog transformation. We prove that leapfrog fullerene graphs on n = 12k − 6 vertices have 2^k Hamilton cycles.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)