Alspach conjectured that any 2 k-regular connected Cayley graph on a finite abelian group A has a hamiltonian decomposition. In this paper, the conjecture is shown true if k = 3, and the order of A is odd. © 2009 Elsevier B.V. All rights reserved
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
AbstractLetGbe a finite group, andSa subset ofGwith 1∉SandS-1=S.IfSis a union of conjugacy classes o...
Let G be a finite group, and S a subset of G with 1 is not an element of S and S-1 = S. If S is a un...
AbstractAlspach conjectured that any 2k-regular connected Cayley graph on a finite abelian group A h...
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...
AbstractWe prove that any 4-regular connected Cayley graph on a finite abelian group can be decompos...
Alspach conjectured that every connected Cayley graph of even valency on a finite Abelian group is H...
This dissertation, “Hamilton Decompositions of 6-Regular Abelian Cayley Graphs”, is hereby ap
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
We show that if G is a nontrivial, finite group of odd order, whose commutator subgroup [G,G] is cyc...
In this article we introduce the concept of (p, α) -switching trees and use it to provide sufficient...
AbstractAlspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abel...
AbstractThe following result is proved: If either G is a finite abelian group or a semidirect produc...
AbstractThe classical question raised by Lovász asks whether every Cayley graph is Hamiltonian. We p...
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
AbstractLetGbe a finite group, andSa subset ofGwith 1∉SandS-1=S.IfSis a union of conjugacy classes o...
Let G be a finite group, and S a subset of G with 1 is not an element of S and S-1 = S. If S is a un...
AbstractAlspach conjectured that any 2k-regular connected Cayley graph on a finite abelian group A h...
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...
AbstractWe prove that any 4-regular connected Cayley graph on a finite abelian group can be decompos...
Alspach conjectured that every connected Cayley graph of even valency on a finite Abelian group is H...
This dissertation, “Hamilton Decompositions of 6-Regular Abelian Cayley Graphs”, is hereby ap
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
We show that if G is a nontrivial, finite group of odd order, whose commutator subgroup [G,G] is cyc...
In this article we introduce the concept of (p, α) -switching trees and use it to provide sufficient...
AbstractAlspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abel...
AbstractThe following result is proved: If either G is a finite abelian group or a semidirect produc...
AbstractThe classical question raised by Lovász asks whether every Cayley graph is Hamiltonian. We p...
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
AbstractLetGbe a finite group, andSa subset ofGwith 1∉SandS-1=S.IfSis a union of conjugacy classes o...
Let G be a finite group, and S a subset of G with 1 is not an element of S and S-1 = S. If S is a un...
DOI
Add to ORKG