The following pages link to A note on graph pebbling (Q1606023):
Displaying 20 items.
- General graph pebbling (Q385150) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- Threshold and complexity results for the cover pebbling game (Q1025557) (← links)
- A note on optimal pebbling of hypercubes (Q1956255) (← links)
- Tiny zero-sum sequences over some special groups (Q2053416) (← links)
- The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree (Q2317614) (← links)
- Inapproximability of the standard pebble game and hard to pebble graphs (Q2405292) (← links)
- The weight function lemma for graph pebbling (Q2410088) (← links)
- Pebbling in powers of paths (Q2689489) (← links)
- Colored pebble motion on graphs (extended abstract) (Q2851461) (← links)
- A Graph Pebbling Algorithm on Weighted Graphs (Q3075605) (← links)
- Pebbling Algorithms in Diameter Two Graphs (Q3563930) (← links)
- (Q4345990) (← links)
- Pebbling dynamic graphs in minimal space (Q4365023) (← links)
- (Q4542545) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- (Q5753770) (← links)
- The Complexity of Graph Pebbling (Q5757392) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)
- Pebbling in Kneser graphs (Q6547946) (← links)