scientific article; zbMATH DE number 5139447

MaRDI QIDQ3429488zbMATHFDO

Authors Dalibor Fronček, Mariusz Meszka

Publication date 2 April 2007

zbMATH Keywords

graph decompositionOberwolfach problemgraph designcheesecake factory problem

Mathematics Subject Classification ID

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

Cited in

(2)

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

This page was built for publication:

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