Rectangular table negotiation problem revisited

DOI10.2478/S11533-011-0064-5zbMath1233.05155OpenAlexW2027059973MaRDI QIDQ657422

Michael Kubesa, Dalibor Fronček

Publication date: 16 January 2012

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-011-0064-5

zbMATH Keywords

Oberwolfach problemGraph decompositionGraph factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\)
• Oberwolfach rectangular table negotiation problem
• The solution of the bipartite analogue of the Oberwolfach problem
• On Rosa-type labelings and cyclic graph decompositions

This page was built for publication: Rectangular table negotiation problem revisited