Recommendations
Cited in
(only showing first 100 items - show all)- Graph pegging numbers
- Threshold and complexity results for the cover pebbling game
- Graham's pebbling conjecture on product of thorn graphs of complete graphs
- Rubbling and optimal rubbling of graphs
- Pebbling graphs
- An improved upper bound for the pebbling threshold of the n-path
- The pebbling number of \(C_5\times C_5\)
- Optimally pebbling hypercubes and powers
- Graham's pebbling conjecture on product of complete bipartite graphs
- Saving probe bits by cube domination
- Doppelgangers and Lemke graphs
- Two-pebbling and odd-two-pebbling are not equivalent
- Domination cover rubbling
- Optimal pebbling number of graphs with given minimum degree
- The 2-pebbling property for dense graphs
- On the t-pebbling number and the 2t-pebbling property of graphs
- A note on optimal pebbling of hypercubes
- On an inverse problem of Erdős, Kleitman, and Lemke
- Optimal pebbling and rubbling of graphs with given diameter
- Two-player pebbling on diameter 2 graphs
- Tiny zero-sum sequences over some special groups
- A new lower bound on the optimal pebbling number of the grid
- The optimal pebbling of spindle graphs
- Optimal pebbling number of the square grid
- The 2-pebbling property of squares of paths and Graham's conjecture
- Total domination cover rubbling
- Cover rubbling and stacking
- Computing bounds on product graph pebbling numbers
- The optimal t-pebbling number of a certain complete m-ary tree
- The 2-pebbling property of the middle graph of fan graphs
- Lemke graphs and Graham's pebbling conjecture
- Modified linear programming and class 0 bounds for graph pebbling
- The weight function lemma for graph pebbling
- Graph pebbling algorithms and Lemke graphs
- Pebble sets in convex polygons
- Improved pebbling bounds
- The cover pebbling number of graphs
- Pebbling numbers of some graphs
- Optimal pebbling of graphs
- Cycles and girth in pebble assignment graphs
- Pebbling in powers of paths
- Pebbling graphs of diameter three and four
- Network decontamination with a single agent
- Optimal pebbling on grids
- On the Relative Strength of Pebbling and Resolution
- Pebbling on zig-zag chain graph of n odd cycles
- The t-pebbling number of Lamp graphs
- The game of blocking pebbles
- Cover Pebbling Thresholds for the Complete Graph
- The t-pebbling number of Jahangir graph J3,m
- t-pebbling and extensions
- Generalizedt-pebbling number of a graph
- A tight bound for black and white pebbles on the pyramid
- General graph pebbling
- The t-pebbling number of C₅ C₅
- Generalizations of Graham's pebbling conjecture
- Counterexamples to a monotonicity conjecture for the threshold pebbling number
- Pebbling number of squares of odd cycles
- The pebbling number of squares of even cycles
- On a combinatorial problem of Erdős, Kleitman and Lemke
- Pebbling on graph products and other binary graph constructions
- Pebbling graphs of diameter three and four
- Using error-correcting codes to construct solvable pebbling distributions
- On reconfiguration graphs: an abstraction
- Herscovici's conjecture on products of shadow graphs of paths
- A note on pebbling bound for a product of class 0 graphs
- SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS
- Monophonic pebbling number and t-pebbling number of some graphs
- Bounds for the pebbling number of product graphs
- Beyond NP: quantifying over answer sets
- Restricted optimal pebbling and domination in graphs
- The \(t\)-pebbling number of squares of cycles
- scientific article; zbMATH DE number 7280167 (Why is no real title available?)
- Pebbling on the middle graph of a complete binary tree
- Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
- Pebbling in semi-2-trees
- Pebbling graphs of fixed diameter
- Herscovici's conjecture on \(C_{2 n}\times G \)
- Strict optimal rubbling of graphs
- scientific article; zbMATH DE number 7709890 (Why is no real title available?)
- Maximal matching cover pebbling number for variants of hypercube
- Herscovici’s Conjecture on Product of Some Complete Bipartite Graphs
- Automating weight function generation in graph pebbling
- Pebbling in Kneser graphs
- Monophonic pebbling number of some network-related graphs
- NDC pebbling number for some class of graphs
- Pebbling number and 2-pebbling property for the middle graphs of the graph obtained from fan graph by deleting \(f\) independent edges
- Restricted optimal pebbling is NP-hard
- On the target pebbling conjecture
- On binary DCP labeling
- Monophonic pebbling number of some families of cycles
- On the secure vertex cover pebbling number
- On the pebbling numbers of flower, Blanuša and Watkins snarks
- Target pebbling in trees
- Pebbling Cartesian products of C₅
- The t-pebbling number and 2t-pebbling property of rooted product of some graphs
- Pebbling number of polymers
- 2-target t-pebbling number of path-derived graphs
- Thresholds for zero-sums with small cross numbers in abelian groups
- Optimal pebbling of complete binary trees and a meta-Fibonacci sequence
This page was built for publication: Pebbling in Hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348937)
