Sciweavers

147 search results - page 1 / 30
» Cycle decompositions of the complete graph
Sort
View
JCT
2010
158views more  JCT 2010»
14 years 11 months ago
An asymptotic solution to the cycle decomposition problem for complete graphs
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
Darryn E. Bryant, Daniel Horsley
72
Voted
DM
2008
63views more  DM 2008»
15 years 15 days ago
Nomadic decompositions of bidirected complete graphs
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
Daniel W. Cranston
ARSCOM
2006
66views more  ARSCOM 2006»
15 years 14 days ago
Cycle decompositions of the complete graph
Anthony J. W. Hilton, Matthew Johnson