Pebbling graphs

From MaRDI portal
Publication:1204476

DOI10.1016/0095-8956(92)90043-WzbMath0772.05093OpenAlexW2911540966MaRDI QIDQ1204476

David Moews

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90043-w




Related Items (38)

Lemke graphs and Graham's pebbling conjectureOn the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parityThe optimal rubbling number of ladders, prisms and Möbius-laddersThe t-pebbling number of Jahangir graph J3,mDoppelgangers and Lemke graphsOptimal pebbling number of the square gridModified linear programming and class 0 bounds for graph pebblingGeneral graph pebblingThe \(t\)-pebbling number of \(C_5\square C_5\)Graph pebbling algorithms and Lemke graphsStrict optimal rubbling of graphsThe 2-pebbling property of squares of paths and Graham's conjectureThe 2-pebbling property for dense graphsPebbling in powers of pathsAutomating weight function generation in graph pebblingOn the \(t\)-pebbling number and the \(2t\)-pebbling property of graphsGeneralizations of Graham's pebbling conjectureA note on optimal pebbling of hypercubesTwo-pebbling and odd-two-pebbling are not equivalentPebbling number of squares of odd cyclesThe pebbling number of squares of even cyclesPebbling on zig-zag chain graph of n odd cyclesHerscovici's conjecture on the product of the thorn graphs of the complete graphsThe pebbling threshold of the square of cliquesImproved pebbling boundsThe cover pebbling number of graphsThe proof of a conjecture due to SnevilyPebbling C5× C5using linear programmingPebbling numbers of some graphsComputing bounds on product graph pebbling numbersGraham's pebbling conjecture on products of many cyclesPebbling on Graph Products and other Binary Graph ConstructionsGeneralizedt-pebbling number of a graphGraham's pebbling conjecture on product of thorn graphs of complete graphsRubbling and optimal rubbling of graphsThe pebbling number of \(C_5\times C_5\)Herscovici’s conjecture on C2n × GGraham's pebbling conjecture on product of complete bipartite graphs



Cites Work


This page was built for publication: Pebbling graphs