Packing parameters in graphs: new bounds and a solution to an open problem (Q2331585)
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 7124101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing parameters in graphs: new bounds and a solution to an open problem |
scientific article; zbMATH DE number 7124101 |
Statements
Packing parameters in graphs: new bounds and a solution to an open problem (English)
0 references
29 October 2019
0 references
packing number
0 references
open packing number
0 references
Nordhaus-Gaddum inequality
0 references
open problem
0 references
triangle-free graph
0 references
0.8383896946907043
0 references
0.8140372037887573
0 references
0.8091254830360413
0 references
0.806023120880127
0 references
