Packings and coverings of the complete directed multigraph with 3- and 4-circuits (Q1356652): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3981360 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of the complete directed graph into k-circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3872478 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198779 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5619847 / rank | |||
Normal rank | |||
Latest revision as of 14:11, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packings and coverings of the complete directed multigraph with 3- and 4-circuits |
scientific article |
Statements
Packings and coverings of the complete directed multigraph with 3- and 4-circuits (English)
0 references
10 June 1997
0 references
directed graph
0 references
Mendelsohn design
0 references
complete directed multigraph
0 references
directed cycle
0 references
maximal packings
0 references
minimal coverings
0 references
packing number
0 references
covering number
0 references
