Pebbling and Graham's conjecture

DOI10.1016/S0012-365X(00)00177-1zbMath0982.05100OpenAlexW2042634486WikidataQ123010052 ScholiaQ123010052MaRDI QIDQ1841936

Stephen S. Wang

Publication date: 8 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00177-1

zbMATH Keywords

pebbling numberpebbling movepebble configuration

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (16)

Lemke graphs and Graham's pebbling conjecture ⋮ Doppelgangers and Lemke graphs ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Strict optimal rubbling of graphs ⋮ The 2-pebbling property for dense graphs ⋮ Automating weight function generation in graph pebbling ⋮ On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs ⋮ Two-pebbling and odd-two-pebbling are not equivalent ⋮ 1-restricted optimal rubbling on graphs ⋮ Herscovici's conjecture on the product of the thorn graphs of the complete graphs ⋮ Bounds for the pebbling number of product graphs ⋮ The proof of a conjecture due to Snevily ⋮ 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 ⋮ Pebbling on Graph Products and other Binary Graph Constructions

This page was built for publication: Pebbling and Graham's conjecture