Journal of Combinatorial Designs · 2000 · 49 citations · 6 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsDirected Acyclic GraphsGraph AlgorithmsGraph TheoryMatroid TheoryComputational Complexity Of Graph AlgorithmsGraph DecompositionsSubgraph Isomorphism
We consider the following generalization of the Oberwolfach problem: “At a gathering there are n delegations each having m people. Is it possible to arrange a seating of mn people present at s round tables (where can accommodate people and ) for k different meals so that each person has every other person not in the same delegation for a neighbour exactly once?”. We will concentrate on the case when all tables accommodate the same number t of people, give a complete solution for t even and settle most cases for t odd. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 42–49, 2000
6