Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\) (Q658064): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q891318 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Appu Muthusamy / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.09.030 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W305678198 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Oberwolfach rectangular table negotiation problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3429488 / rank | |||
Normal rank |
Latest revision as of 19:30, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\) |
scientific article |
Statements
Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\) (English)
0 references
11 January 2012
0 references
bigraceful labeling
0 references
rectangular table negotiation problem
0 references