Pebbling in Hypercubes

From MaRDI portal
Publication:3348937

DOI10.1137/0402041zbMath0727.05043OpenAlexW2013252038WikidataQ30052298 ScholiaQ30052298MaRDI QIDQ3348937

Fan R. K. Chung

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1137/0402041




Related Items (82)

Lemke graphs and Graham's pebbling conjectureNetwork decontamination with a single agentOptimal pebbling on gridsThe t-pebbling number of Jahangir graph J3,mA note on pebbling bound for a product of Class 0 graphsOptimal pebbling of graphsSECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHSDoppelgangers and Lemke graphs\(t\)-pebbling and extensionsOptimal pebbling number of the square gridModified linear programming and class 0 bounds for graph pebblingThe weight function lemma for graph pebblingGeneral graph pebblingThe \(t\)-pebbling number of \(C_5\square C_5\)Monophonic pebbling number and t-pebbling number of some graphsGraph pebbling algorithms and Lemke graphsCycles and girth in pebble assignment graphsStrict optimal rubbling of graphsThe 2-pebbling property of squares of paths and Graham's conjectureTotal domination cover rubblingBeyond NP: Quantifying over Answer SetsPebbling Graphs of Diameter Three and FourThe 2-pebbling property for dense graphsMaximal matching cover pebbling number for variants of hypercubeCover rubbling and stackingPebbling in powers of pathsHerscovici’s Conjecture on Product of Some Complete Bipartite GraphsAutomating weight function generation in graph pebblingOn the \(t\)-pebbling number and the \(2t\)-pebbling property of graphsGeneralizations of Graham's pebbling conjectureCounterexamples to a monotonicity conjecture for the threshold pebbling numberA note on optimal pebbling of hypercubesTwo-pebbling and odd-two-pebbling are not equivalentAn improved upper bound for the pebbling threshold of the \(n\)-pathUnnamed ItemPebbling number of squares of odd cyclesThe pebbling number of squares of even cyclesOn a combinatorial problem of Erdős, Kleitman and LemkeUnnamed ItemUnnamed ItemPebbling on zig-zag chain graph of n odd cyclesThe t-pebbling number of Lamp graphsUnnamed ItemThe pebbling threshold of the square of cliquesDomination cover rubblingOptimal pebbling number of graphs with given minimum degreeUsing error-correcting codes to construct solvable pebbling distributionsRestricted optimal pebbling and domination in graphsPebbling in semi-2-treesPebbling graphsPebbling Graphs of Fixed DiameterBounds for the pebbling number of product graphsImproved pebbling boundsOn an inverse problem of Erdős, Kleitman, and LemkeThe cover pebbling number of graphsThe proof of a conjecture due to SnevilyOptimal pebbling and rubbling of graphs with given diameterPebbling numbers of some graphsComputing bounds on product graph pebbling numbersGraham's pebbling conjecture on products of many cyclesGraham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graphTwo-player pebbling on diameter 2 graphsPebbling on Graph Products and other Binary Graph ConstructionsTiny zero-sum sequences over some special groupsGeneralizedt-pebbling number of a graphGraph pegging numbersThreshold and complexity results for the cover pebbling gameGraham's pebbling conjecture on product of thorn graphs of complete graphsRubbling and optimal rubbling of graphsThe optimal \(t\)-pebbling number of a certain complete \(m\)-ary treeUnnamed ItemUnnamed ItemThe pebbling number of \(C_5\times C_5\)Optimally pebbling hypercubes and powersPebbling Graphs of Diameter Three and FourThe 2-pebbling property of the middle graph of fan graphsA new lower bound on the optimal pebbling number of the gridHerscovici’s conjecture on C2n × GCover Pebbling Thresholds for the Complete GraphThe optimal pebbling of spindle graphsPEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREEGraham's pebbling conjecture on product of complete bipartite graphs




This page was built for publication: Pebbling in Hypercubes