Searching for "On The Alspach Conjecture." – sorted by Relevance.
-
Walecki Tournaments: Part I
- tournaments was determined by Alspach. It was conjectured that the bound is tight. The problem of enumerating
- Add To MetaCart
-
List Decomposition of Graphs
- * and the object is to decompose *Kn. 3. The Alspach conjecture [2, 14]: In this case L is any list of cycles
- Add To MetaCart

