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

Frantisek Kardos Martina Mockovciaková

Published in: J. Graph Theory (2021)

Keyphrases

graph matching
graph theoretic
series parallel
directed graph
graph theory
graph mining
graph representation
graph construction
structured objects
data sets
graph theoretical
computationally hard
graph kernels
graph structure
bipartite graph
pattern recognition
multiscale