Optimally pebbling hypercubes and powers
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Graph pegging numbers
- Rubbling and optimal rubbling of graphs
- Capacity restricted optimal pebbling in graphs
- A note on optimal pebbling of hypercubes
- A new lower bound on the optimal pebbling number of the grid
- The optimal pebbling of spindle graphs
- Distance restricted optimal pebbling in cycles
- The optimal t-pebbling number of a certain complete m-ary tree
- Optimal pebbling on grids
- Optimal pebbling in products of graphs
- Pebbling in Hypercubes
- t-pebbling and extensions
- General graph pebbling
- Using error-correcting codes to construct solvable pebbling distributions
- Restricted optimal pebbling and domination in graphs
- Strict optimal rubbling of graphs
- Pebble minimization: the last theorems
- The pebbling threshold of the square of cliques
This page was built for publication: Optimally pebbling hypercubes and powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584396)