At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
| dc.contributor.author | Kardoš, František | |
| dc.contributor.author | Mockovčiaková, Martina | |
| dc.date.accessioned | 2022-03-07T11:00:20Z | |
| dc.date.available | 2022-03-07T11:00:20Z | |
| dc.date.issued | 2021 | |
| dc.description.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. | cs |
| dc.description.abstract-translated | 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. | en |
| dc.format | 11 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.identifier.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 | cs |
| dc.identifier.document-number | 606535200001 | |
| dc.identifier.doi | 10.1002/jgt.22660 | |
| dc.identifier.issn | 0364-9024 | |
| dc.identifier.obd | 43929632 | |
| dc.identifier.uri | http://hdl.handle.net/11025/47064 | |
| dc.language.iso | en | en |
| dc.project.ID | LO1506/PUNTIS - Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnost | cs |
| dc.project.ID | GA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafy | cs |
| dc.publisher | Wiley | en |
| dc.relation.ispartofseries | Journal of Graph Theory | en |
| dc.rights | Plný text je přístupný v rámci univerzity přihlášeným uživatelům. | cs |
| dc.rights | © Wiley | en |
| dc.rights.access | restrictedAccess | en |
| dc.subject | kubický graf | cs |
| dc.subject | Leapfrog fullerén | cs |
| dc.subject | hamiltonova kružnice | cs |
| dc.subject.translated | Cubic graph | en |
| dc.subject.translated | Leapfrog fullerene graph | en |
| dc.subject.translated | Hamilton cycle | en |
| dc.title | At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |
Files
Original bundle
1 - 1 out of 1 results
No Thumbnail Available
- Name:
- Journal of Graph Theory - 2021 - Kardo - At least half of the leapfrog fullerene graphs have exponentially many Hamilton.pdf
- Size:
- 468.04 KB
- Format:
- Adobe Portable Document Format