Cayley graph and digraph;
vertex-transitive graph;
Hamiltonian paths and cycles;
ABELIAN-GROUPS;
CYCLES;
PATHS;
ORDER;
DECOMPOSITIONS;
CIRCUITS;
D O I:
10.1142/S1793830919300029
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
Lovasz had posed a question stating whether every connected, vertex-transitive graph has a Hamilton path in 1969. There is a growing interest in solving this longstanding problem and still it remains widely open. In fact, it was known that only five vertex-transitive graphs exist without a Hamiltonian cycle which do not belong to Cayley graphs. A Cayley graph is the subclass of vertex-transitive graph, and in view of the Lovasz conjecture, the attention has focused more toward the Hamiltonicity of Cayley graphs. This survey will describe the current status of the search for Hamiltonian cycles and paths in Cayley graphs and digraphs on different groups, and discuss the future direction regarding famous conjecture.
机构:
Univ Alaska Fairbanks, Dept Math & Stat, Fairbanks, AK 99775 USAUniv Alaska Fairbanks, Dept Math & Stat, Fairbanks, AK 99775 USA
Berman, Leah Wrenn
Kovacs, Istvan
论文数: 0引用数: 0
h-index: 0
机构:
Univ Primorska, UP IAM, Muzejski Trg 2, Koper 6000, Slovenia
Univ Primorska, UP FAMNIT, Glagoljaska 8, Koper 6000, SloveniaUniv Alaska Fairbanks, Dept Math & Stat, Fairbanks, AK 99775 USA
Kovacs, Istvan
Williams, Gordon I.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Alaska Fairbanks, Dept Math & Stat, Fairbanks, AK 99775 USAUniv Alaska Fairbanks, Dept Math & Stat, Fairbanks, AK 99775 USA
机构:
Chiang Mai Univ, Dept Math, Ctr Excellence Math & Appl Math, Fac Sci, Huay Kaew Rd, Chiang Mai 50200, ThailandChiang Mai Univ, Dept Math, Ctr Excellence Math & Appl Math, Fac Sci, Huay Kaew Rd, Chiang Mai 50200, Thailand