| Title: | At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles |
| Authors: | Kardoš, František Mockovčiaková, Martina |
| Citation: | KARDOŠ, F. MOCKOVČIAKOVÁ, M. At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles. Journal of Graph Theory, 2021, roč. 97, č. 3, s. 382-392. ISSN: 0364-9024 |
| Issue Date: | 2021 |
| Publisher: | Wiley |
| Document type: | článek article |
| URI: | http://hdl.handle.net/11025/47064 |
| ISSN: | 0364-9024 |
| Keywords: | kubický graf;Leapfrog fullerén;hamiltonova kružnice |
| Keywords in different language: | Cubic graph;Leapfrog fullerene graph;Hamilton cycle |
| Abstract: | Fullerenov graf je kubický rovinný graf. Leapfrog fullerenový graf je.... Dokázali jsme, že leapfrog fullerenový graf, který má n = 12k − 6 vrcholú, má 2^k hamiltonovských krružnic. |
| Abstract in different language: | 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. |
| Rights: | Plný text je přístupný v rámci univerzity přihlášeným uživatelům. © Wiley |
| Appears in Collections: | Články / Articles (KMA) OBD |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| Journal of Graph Theory - 2021 - Kardo - At least half of the leapfrog fullerene graphs have exponentially many Hamilton.pdf | 468,04 kB | Adobe PDF | View/Open Request a copy |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/47064Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.