The following pages link to Optimal pebbling of graphs (Q2643329):
Displaying 31 items.
- Optimal pebbling on grids (Q293664) (← links)
- \(t\)-pebbling and extensions (Q354409) (← links)
- Restricted optimal pebbling and domination in graphs (Q512538) (← links)
- The optimal pebbling number of the caterpillar (Q1026956) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- The optimal pebbling number of the complete \(m\)-ary tree (Q1579551) (← links)
- 1-restricted optimal rubbling on graphs (Q1717213) (← links)
- Optimal pebbling number of graphs with given minimum degree (Q1741506) (← links)
- Capacity restricted optimal pebbling in graphs (Q1741523) (← links)
- A note on optimal pebbling of hypercubes (Q1956255) (← links)
- Optimal pebbling and rubbling of graphs with given diameter (Q2026352) (← links)
- Two-player pebbling on diameter 2 graphs (Q2041086) (← links)
- A new lower bound on the optimal pebbling number of the grid (Q2092437) (← links)
- The optimal pebbling of spindle graphs (Q2111687) (← links)
- Optimal pebbling number of the square grid (Q2175808) (← links)
- Distance restricted optimal pebbling in cycles (Q2181222) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2376084) (← links)
- Modified linear programming and class 0 bounds for graph pebbling (Q2410032) (← links)
- The optimal pebbling number of staircase graphs (Q2421883) (← links)
- Improved pebbling bounds (Q2483419) (← links)
- Optimally \(t\)-pebbling graphs (Q2811833) (← links)
- Pebbling graphs of diameter three and four (Q2851433) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2857393) (← links)
- A Graph Pebbling Algorithm on Weighted Graphs (Q3075605) (← links)
- Optimal \(t\)-pebbling on paths and cycles (Q3462997) (← links)
- Pebbling in diameter two graphs and products of paths (Q4344213) (← links)
- Pebbling dynamic graphs in minimal space (Q4365023) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- The Complexity of Graph Pebbling (Q5757392) (← links)
- Pebble minimization: the last theorems (Q6091210) (← links)
- Restricted optimal pebbling is NP-hard (Q6611025) (← links)
