Rectangular table negotiation problem revisited

DOI10.2478/S11533-011-0064-5MaRDI QIDQ657422zbMATH OpenOpenAlexFDO

Authors Michael Kubesa, Dalibor Fronček

Publication date 16 January 2012

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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)

Recommendations

• Oberwolfach rectangular table negotiation problem
• Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\)
• scientific article; zbMATH DE number 1394637
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• The equipartite Oberwolfach problem with uniform tables

Cites work

• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\)
• Oberwolfach rectangular table negotiation problem
• On Rosa-type labelings and cyclic graph decompositions
• The solution of the bipartite analogue of the Oberwolfach problem

Cited in

(1)

• Oberwolfach rectangular table negotiation problem

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

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