The following pages link to Optimally \(t\)-pebbling graphs (Q2811833):
Displaying 13 items.
- \(t\)-pebbling and extensions (Q354409) (← links)
- Using error-correcting codes to construct solvable pebbling distributions (Q501069) (← links)
- Optimally pebbling hypercubes and powers (Q1584396) (← links)
- Capacity restricted optimal pebbling in graphs (Q1741523) (← links)
- A note on optimal pebbling of hypercubes (Q1956255) (← links)
- Distance restricted optimal pebbling in paths (Q2022505) (← links)
- The optimal pebbling of spindle graphs (Q2111687) (← links)
- Distance restricted optimal pebbling in cycles (Q2181222) (← links)
- The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree (Q2317614) (← links)
- Optimal \(t\)-pebbling on paths and cycles (Q3462997) (← links)
- Pebbling dynamic graphs in minimal space (Q4365023) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- Optimal t-rubbling on complete graphs and paths (Q6063837) (← links)