/manager/Index ${session.getAttribute("locale")} 5 Hamilton paths in Cayley graphs on Coxeter groups: I /manager/Repository/uon:28294 n, 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.]]> Thu 17 Sep 2020 09:45:52 AEST ]]> On the Hamilton connectivity of generalized Petersen graphs /manager/Repository/uon:8134 Sat 24 Mar 2018 08:40:04 AEDT ]]> Hamilton paths in Cayley graphs on generalized dihedral groups /manager/Repository/uon:11211 Sat 24 Mar 2018 08:12:45 AEDT ]]> Johnson graphs are Hamilton-connected /manager/Repository/uon:19703 Sat 24 Mar 2018 07:53:48 AEDT ]]>