| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423878 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
Abstract
We prove that every sufficiently large dense connected vertex-transitive graph is Hamiltonian.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Demetres Christofides, Jan Hladký, Andras Máthé,