Every connected vertex-transitive graph of order 10p, p prime and p ≠ 7, has a Hamilton path; the exceptional PSL(2,s^m) coset graphs are shown to contain Hamilton cycles.
Alspach, The search for long paths and cycles in vertex-tran sitive graphs and digraphs, in: Kevin L
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Hamilton paths in vertex-transitive graphs of order $10p$
Every connected vertex-transitive graph of order 10p, p prime and p ≠ 7, has a Hamilton path; the exceptional PSL(2,s^m) coset graphs are shown to contain Hamilton cycles.