The 2-pebbling property and a conjecture of Graham's

zbMath0971.05063MaRDI QIDQ1576576

Hunter S. Snevily, James A. Foster

Publication date: 30 October 2001

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

pebblepebbling numberLemke graphGraham conjecture2-pebbling property

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

Lemke graphs and Graham's pebbling conjecture, On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity, Doppelgangers and Lemke graphs, The \(t\)-pebbling number of \(C_5\square C_5\), Graph pebbling algorithms and Lemke graphs, Strict optimal rubbling of graphs, The 2-pebbling property of squares of paths and Graham's conjecture, The 2-pebbling property for dense graphs, Herscovici’s Conjecture on Product of Some Complete Bipartite Graphs, On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs, Two-pebbling and odd-two-pebbling are not equivalent, Pebbling number of squares of odd cycles, The pebbling number of squares of even cycles, The proof of a conjecture due to Snevily, Pebbling numbers of some graphs, Computing bounds on product graph pebbling numbers, Graham's pebbling conjecture on products of many cycles, Pebbling on Graph Products and other Binary Graph Constructions, Graham's pebbling conjecture on product of thorn graphs of complete graphs, The pebbling number of \(C_5\times C_5\), The 2-pebbling property of the middle graph of fan graphs, Herscovici’s conjecture on C2n × G, The optimal pebbling of spindle graphs