Integer-programming bounds on pebbling numbers of Cartesian-product graphs (Q2327149)
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 7116414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer-programming bounds on pebbling numbers of Cartesian-product graphs |
scientific article; zbMATH DE number 7116414 |
Statements
Integer-programming bounds on pebbling numbers of Cartesian-product graphs (English)
0 references
11 October 2019
0 references
0.9457229
0 references
0.9439214
0 references
0.91486835
0 references
0.9138237
0 references
0.89604414
0 references
0.89351153
0 references
0 references
0.8896426
0 references
0.88930005
0 references
