| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649055 | Discrete Mathematics | 2007 | 7 Pages |
Abstract
A successful heuristic algorithm for finding Hamilton cycles in cubic graphs is described. Several graphs from The Foster Census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL2(7)PSL2(7) are shown to be Hamiltonian.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Janez Aleš, Bojan Mohar, Tomaž Pisanski,