Oberwolfach rectangular table negotiation problem

DOI10.1016/J.DISC.2008.02.034zbMath1160.05047OpenAlexW2028178249MaRDI QIDQ998546

Dalibor Fronček

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.034

zbMATH Keywords

complete bipartite graphsgraph decompositiongraph factorizationOberwolfach problemfactors of bipartite graphstwo delegation negotiation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Rectangular table negotiation problem revisited ⋮ Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\)

Cites Work

• The solution of the bipartite analogue of the Oberwolfach problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Oberwolfach rectangular table negotiation problem