A note on optimal pebbling of hypercubes
From MaRDI portal
Recommendations
- Optimally pebbling hypercubes and powers
- Pebbling in Hypercubes
- Pebbling and optimal pebbling in graphs
- Optimal pebbling on grids
- A new lower bound on the optimal pebbling number of the grid
- Optimal pebbling of graphs
- Optimal t-pebbling in cycles
- Optimal pebbling and rubbling of graphs with given diameter
- Optimal pebbling in products of graphs
- A note on graph pebbling
Cites work
- An addition theorem on the integers modulo n
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1145909 (Why is no real title available?)
- Optimally t-pebbling graphs
- Optimally pebbling hypercubes and powers
- Pebbling graphs
- Pebbling in diameter two graphs and products of paths
- Pebbling in Hypercubes
- The optimal pebbling number of the caterpillar
- The optimal pebbling number of the complete \(m\)-ary tree
- The pebbling number of \(C_5\times C_5\)
Cited in
(10)- Optimally pebbling hypercubes and powers
- Capacity restricted optimal pebbling in graphs
- Distance restricted optimal pebbling in cycles
- The optimal t-pebbling number of a certain complete m-ary tree
- Large hypertree width for sparse random hypergraphs
- Pebbling in Hypercubes
- A tight bound for black and white pebbles on the pyramid
- Using error-correcting codes to construct solvable pebbling distributions
- Restricted optimal pebbling and domination in graphs
- 2-restricted optimal pebbling number of some dendrimers
This page was built for publication: A note on optimal pebbling of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1956255)
