Factorization of \(K_{n,n}\) into \((0,j)\)-prisms (Q989530): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Cube factorizations of complete graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4221902 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4488579 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3480087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The solution of the bipartite analogue of the Oberwolfach problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5589124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4853711 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4332941 / rank | |||
Normal rank |
Latest revision as of 02:21, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Factorization of \(K_{n,n}\) into \((0,j)\)-prisms |
scientific article |
Statements
Factorization of \(K_{n,n}\) into \((0,j)\)-prisms (English)
0 references
20 August 2010
0 references
factorization
0 references
prism
0 references
graph algorithms
0 references