Almost resolvable maximum packings of complete graphs with 4-cycles (Q659680): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3101003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new class of group divisible designs with block size three / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5441060 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3526001 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing and Covering of the Complete Graph with 4-Cycles<sup>*</sup> / rank | |||
Normal rank | |||
Latest revision as of 21:22, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost resolvable maximum packings of complete graphs with 4-cycles |
scientific article |
Statements
Almost resolvable maximum packings of complete graphs with 4-cycles (English)
0 references
24 January 2012
0 references
4-Cycle system
0 references
Resolvable cycle system maximum packing
0 references
Almost resolvable maximum packing
0 references
