The packing and covering of the complete graph. I: The forests of order five (Q1086247)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3983185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The packing and covering of the complete graph. I: The forests of order five |
scientific article; zbMATH DE number 3983185 |
Statements
The packing and covering of the complete graph. I: The forests of order five (English)
0 references
1986
0 references
The maximum number of pairwise edge disjoint forests of order five in the complete graph \(K_ n\), and the minimum number of forests of order five whose union is \(K_ n\), are determined.
0 references
packing
0 references
covering
0 references
decomposition
0 references
forests
0 references
0.8298105001449585
0 references
0.8213598132133484
0 references
0.8213598132133484
0 references
