Pages that link to "Item:Q1609686"
From MaRDI portal
The following pages link to Graham's pebbling conjecture on product of complete bipartite graphs (Q1609686):
Displaying 21 items.
- General graph pebbling (Q385150) (← links)
- Pebbling number of squares of odd cycles (Q456657) (← links)
- The pebbling number of squares of even cycles (Q456661) (← links)
- Graham's pebbling conjecture on products of many cycles (Q998388) (← links)
- Graham's pebbling conjecture on product of thorn graphs of complete graphs (Q1025977) (← links)
- 1-restricted optimal rubbling on graphs (Q1717213) (← links)
- Complexity of products of some complete and complete bipartite graphs (Q1790058) (← links)
- The 2-pebbling property of squares of paths and Graham's conjecture (Q2189217) (← links)
- Computing bounds on product graph pebbling numbers (Q2283021) (← links)
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs (Q2327149) (← links)
- Modified linear programming and class 0 bounds for graph pebbling (Q2410032) (← links)
- Pebbling numbers of some graphs (Q2503771) (← links)
- The Graham's pebbling conjecture for \(K_{r,s}^{-k_1}\times K_{m,n}^{-k_2}\). (Q2864441) (← links)
- (Q3571906) (← links)
- (Q3640976) (← links)
- A note on pebbling bound for a product of Class 0 graphs (Q5064377) (← links)
- Bounds for the pebbling number of product graphs (Q5104010) (← links)
- Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph (Q5207502) (← links)
- Graham's Pebbling Conjecture Holds for the Product of a Graph and a Sufficiently Large Complete Graph (Q5213546) (← links)
- Strict optimal rubbling of graphs (Q6064866) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)
