The following pages link to Improved pebbling bounds (Q2483419):
Displaying 11 items.
- General graph pebbling (Q385150) (← links)
- Pebbling in semi-2-trees (Q526223) (← links)
- Threshold and complexity results for the cover pebbling game (Q1025557) (← links)
- Thresholds for families of multisets, with an application to graph pebbling (Q1402065) (← 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)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2857393) (← links)
- On the Relative Strength of Pebbling and Resolution (Q2946664) (← links)
- Pebbling Graphs of Fixed Diameter (Q5417824) (← links)
- Pebbling in Kneser graphs (Q6547946) (← links)
- On the pebbling numbers of flower, Blanuša and Watkins snarks (Q6657240) (← links)