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

DOI10.1016/J.DISC.2011.09.030zbMATH Open1238.05207OpenAlexW305678198MaRDI QIDQ658064FDOQ658064

Authors: V. Chitra, A. 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

Recommendations

• On \(K_{1,k}\)-factorization of bipartite multigraphs
• Publication:4488570
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• \(K_{1,k}\)-factorization of bipartite graphs
• On \(K_{p,q}\)-factorization of complete bipartite multigraphs
• Complete bipartite factorisations of \(K _{n,n}\)
• \(K_{1,p^2}\)-factorization of complete bipartite graphs
• \(K_{p,q}\)-factorization of the complete bipartite graph \(K_{m,n}\)
• On \(K_{1,k}\)-factorizations of a complete bipartite graph
• \(C_ k\)-factorization of complete bipartite graphs

zbMATH Keywords

bigraceful labelingrectangular table negotiation problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Oberwolfach rectangular table negotiation problem

Cited In (2)

• Rectangular table negotiation problem revisited
• Oberwolfach rectangular table negotiation problem

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

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