Graham's pebbling conjecture on product of complete bipartite graphs
From MaRDI portal
Publication:1609686
DOI10.1007/BF02880130zbMath0999.05096OpenAlexW1741904847WikidataQ123278194 ScholiaQ123278194MaRDI QIDQ1609686
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
Related Items (15)
A note on pebbling bound for a product of Class 0 graphs ⋮ Modified linear programming and class 0 bounds for graph pebbling ⋮ General graph pebbling ⋮ Strict optimal rubbling of graphs ⋮ The 2-pebbling property of squares of paths and Graham's conjecture ⋮ Automating weight function generation in graph pebbling ⋮ Pebbling number of squares of odd cycles ⋮ The pebbling number of squares of even cycles ⋮ 1-restricted optimal rubbling on graphs ⋮ Bounds for the pebbling number of product graphs ⋮ Pebbling numbers of some graphs ⋮ Computing bounds on product graph pebbling numbers ⋮ Graham's pebbling conjecture on products of many cycles ⋮ Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph ⋮ Graham's pebbling conjecture on product of thorn graphs of complete graphs
Cites Work
This page was built for publication: Graham's pebbling conjecture on product of complete bipartite graphs
