We consider several families of Cayley graphs on the finite Coxeter groups An, Bn, and Dn with regard to the problem of whether they are Hamilton-laceable or Hamilton-connected. It is known that every connected bipartite Cayley graph on An, n ≥ 2, whose connection set contains only transpositions and has valency at least three is Hamilton-laceable. We obtain analogous results for connected bipartite Cayley graphs on Bn, and for connected Cayley graphs on Dn. Non-bipartite examples arise for the latter family.
@article{509,
title = {Hamilton paths in Cayley graphs on Coxeter groups: I},
journal = {ARS MATHEMATICA CONTEMPORANEA},
volume = {9},
year = {2014},
doi = {10.26493/1855-3974.509.d9d},
language = {EN},
url = {http://dml.mathdoc.fr/item/509}
}
Alspach, Brian. Hamilton paths in Cayley graphs on Coxeter groups: I. ARS MATHEMATICA CONTEMPORANEA, Tome 9 (2014) . doi : 10.26493/1855-3974.509.d9d. http://gdmltest.u-ga.fr/item/509/