Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph (Q5207502)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph |
scientific article; zbMATH DE number 7147032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph |
scientific article; zbMATH DE number 7147032 |
Statements
Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph (English)
0 references
2 January 2020
0 references
graph pebbling
0 references
Cartesian product graph
0 references
Graham's conjecture
0 references
complete bipartite graph
0 references
0.943419873714447
0 references
0.9274983406066896
0 references
0.9160560369491576
0 references
0.9039278030395508
0 references
