Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
From MaRDI portal
Publication:5207502
Recommendations
- Graham's pebbling conjecture on product of complete bipartite graphs
- Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete graph
- The Graham's pebbling conjecture for \(K_{r,s}^{-k_1}\times K_{m,n}^{-k_2}\).
- scientific article; zbMATH DE number 2094625
- Pebbling number of some bipartite graphs
Cites work
- Graham's pebbling conjecture on product of complete bipartite graphs
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Pebbling and Graham's conjecture
- Pebbling in Hypercubes
- The proof of a conjecture due to Snevily
- The weight function lemma for graph pebbling
Cited in
(7)- Graham's pebbling conjecture on product of complete bipartite graphs
- The Graham's pebbling conjecture for \(K_{r,s}^{-k_1}\times K_{m,n}^{-k_2}\).
- scientific article; zbMATH DE number 5630405 (Why is no real title available?)
- A note on pebbling bound for a product of class 0 graphs
- Bounds for the pebbling number of product graphs
- Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete graph
- On the target pebbling conjecture
This page was built for publication: Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207502)