Oberwolfach rectangular table negotiation problem

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


We completely solve certain case of a "two delegation negotiation" version of the Oberwolfach problem, which can be stated as follows. Let H (k, 3) be a bipartite graph with bipartition X = {x1, x2, ..., xk}, Y = {y1, y2, ..., yk} and edges x1 y1, x1 y2, xk yk - 1, xk yk, and xi yi - 1, xi yi, xi yi + 1 for i = 2, 3, ..., k - 1. We completely characterize all complete bipartite graphs Kn, n that can be factorized into factors isomorphic to G = m H (k, 3), where k is odd and m H (k, 3) is the graph consisting of m disjoint copies of H (k, 3).

Original languageEnglish (US)
Pages (from-to)501-504
Number of pages4
JournalDiscrete Mathematics
Issue number2
StatePublished - Jan 28 2009

Bibliographical note

Funding Information:
Research for this article was supported by the University of Minnesota Duluth Grant 177–1009. The author would like to thank the anonymous referee whose comments helped to improve the paper.


  • Graph decomposition
  • Oberwolfach problem


Dive into the research topics of 'Oberwolfach rectangular table negotiation problem'. Together they form a unique fingerprint.

Cite this