Graham's pebbling conjecture on product of complete bipartite graphs
From MaRDI portal
Publication:1609686
DOI10.1007/BF02880130zbMATH Open0999.05096OpenAlexW1741904847WikidataQ123278194 ScholiaQ123278194MaRDI QIDQ1609686FDOQ1609686
Publication date: 15 August 2002
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02880130
Recommendations
- The Graham's pebbling conjecture for \(K_{r,s}^{-k_1}\times K_{m,n}^{-k_2}\).
- scientific article; zbMATH DE number 2094625
- Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
- Pebbling number of some bipartite graphs
- Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete graph
Cites Work
Cited In (21)
- Complexity of products of some complete and complete bipartite graphs
- Title not available (Why is that?)
- Graham's pebbling conjecture on products of many cycles
- Computing bounds on product graph pebbling numbers
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Modified linear programming and class 0 bounds for graph pebbling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds for the pebbling number of product graphs
- Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
- Pebbling numbers of some graphs
- The 2-pebbling property of squares of paths and Graham's conjecture
- Pebbling number of squares of odd cycles
- The pebbling number of squares of even cycles
- A note on pebbling bound for a product of Class 0 graphs
- Automating weight function generation in graph pebbling
- Title not available (Why is that?)
- Graham's pebbling conjecture on product of thorn graphs of complete graphs
- Strict optimal rubbling of graphs
- General graph pebbling
- 1-restricted optimal rubbling on graphs
This page was built for publication: Graham's pebbling conjecture on product of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609686)