In this article we introduce the concept of (p, α) -switching trees and use it to provide sufficient conditions on the abelian groups G and H for when CAY (G × H; S⊆B) is Hamilton-decomposable, given that CAY (G; S) is Hamilton-decomposable and B is a basis for H. Applications of this result to elementary abelian groups and Paley graphs are given. © 2013 Elsevier B.V. All rights reserved
AbstractAlspach conjectured that any 2k-regular connected Cayley graph on a finite abelian group A h...
AbstractThe following result is proved: If either G is a finite abelian group or a semidirect produc...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
In this article we introduce the concept of (p, alpha)-switching trees and use it to provide suffici...
AbstractAlspach conjectured that every connected Cayley graph of even valency on a finite Abelian gr...
Alspach conjectured that every connected Cayley graph on a finite Abelian group A is Hamilton-decomp...
Alspach conjectured that any 2 k-regular connected Cayley graph on a finite abelian group A has a ha...
Alspach conjectured that every connected Cayley graph of even valency on a finite Abelian group is H...
AbstractWe prove that any 4-regular connected Cayley graph on a finite abelian group can be decompos...
AbstractThe classical question raised by Lovász asks whether every Cayley graph is Hamiltonian. We p...
In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduce...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
AbstractLet G be a group generated by X. A Cayley graph over G is defined as a graph G(X) whose vert...
In the master thesis we are dealing with a very well known family of graphs with a lot of symmetry,...
AbstractA bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every p...
AbstractAlspach conjectured that any 2k-regular connected Cayley graph on a finite abelian group A h...
AbstractThe following result is proved: If either G is a finite abelian group or a semidirect produc...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
In this article we introduce the concept of (p, alpha)-switching trees and use it to provide suffici...
AbstractAlspach conjectured that every connected Cayley graph of even valency on a finite Abelian gr...
Alspach conjectured that every connected Cayley graph on a finite Abelian group A is Hamilton-decomp...
Alspach conjectured that any 2 k-regular connected Cayley graph on a finite abelian group A has a ha...
Alspach conjectured that every connected Cayley graph of even valency on a finite Abelian group is H...
AbstractWe prove that any 4-regular connected Cayley graph on a finite abelian group can be decompos...
AbstractThe classical question raised by Lovász asks whether every Cayley graph is Hamiltonian. We p...
In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduce...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
AbstractLet G be a group generated by X. A Cayley graph over G is defined as a graph G(X) whose vert...
In the master thesis we are dealing with a very well known family of graphs with a lot of symmetry,...
AbstractA bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every p...
AbstractAlspach conjectured that any 2k-regular connected Cayley graph on a finite abelian group A h...
AbstractThe following result is proved: If either G is a finite abelian group or a semidirect produc...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...