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

DOI10.1016/J.DISC.2011.09.030zbMath1238.05207OpenAlexW305678198MaRDI QIDQ658064

V. Chitra, Appu Muthusamy

Publication date: 11 January 2012

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

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

zbMATH Keywords

bigraceful labelingrectangular table negotiation problem

Mathematics Subject Classification ID

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

Related Items (1)

Rectangular table negotiation problem revisited

Cites Work

• Oberwolfach rectangular table negotiation problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\)