Oberwolfach rectangular table negotiation problem

DOI10.1016/J.DISC.2008.02.034MaRDI QIDQ998546zbMATH OpenOpenAlexFDO

Authors 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

graph decompositiongraph factorizationcomplete bipartite graphsOberwolfach problemfactors of bipartite graphstwo delegation negotiation

Mathematics Subject Classification ID

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

Recommendations

• Rectangular table negotiation problem revisited
• Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\)
• The solution of the bipartite analogue of the Oberwolfach problem
• A complete solution to the two-table Oberwolfach problems
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem

Cites work

• scientific article; zbMATH DE number 5139447 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• The solution of the bipartite analogue of the Oberwolfach problem

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998546)