Abstract
It is proven that every connected Cayley graph X, of valency at least three, on a Hamiltonian group is either Hamilton laceable when X is bipartite, or Hamilton connected when X is not bipartite. © 2001 Academic Press.
Cite
CITATION STYLE
APA
Alspach, B., & Qin, Y. (2001). Hamilton-Connected Cayley Graphs on Hamiltonian Groups. European Journal of Combinatorics, 22(6), 777–787. https://doi.org/10.1006/eujc.2001.0456
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free