The following pages link to The Complexity of Graph Pebbling (Q5757392):
Displaying 39 items.
- Optimal pebbling on grids (Q293664) (← links)
- Pebbling in 2-paths (Q324757) (← links)
- General graph pebbling (Q385150) (← links)
- Restricted optimal pebbling and domination in graphs (Q512538) (← links)
- Pebbling in semi-2-trees (Q526223) (← links)
- Graham's pebbling conjecture on products of many cycles (Q998388) (← links)
- Threshold and complexity results for the cover pebbling game (Q1025557) (← links)
- Rubbling and optimal rubbling of graphs (Q1025979) (← links)
- The optimal pebbling number of the complete \(m\)-ary tree (Q1579551) (← links)
- Optimal pebbling number of graphs with given minimum degree (Q1741506) (← links)
- Capacity restricted optimal pebbling in graphs (Q1741523) (← links)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- Optimal pebbling and rubbling of graphs with given diameter (Q2026352) (← 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)
- Computing bounds on product graph pebbling numbers (Q2283021) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2376084) (← links)
- Inapproximability of the standard pebble game and hard to pebble graphs (Q2405292) (← links)
- Modified linear programming and class 0 bounds for graph pebbling (Q2410032) (← links)
- The weight function lemma for graph pebbling (Q2410088) (← links)
- Graph pebbling algorithms and Lemke graphs (Q2416420) (← links)
- The optimal pebbling number of staircase graphs (Q2421883) (← links)
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs (Q2449128) (← links)
- Pebbling in powers of paths (Q2689489) (← links)
- On the Relative Strength of Pebbling and Resolution (Q2946664) (← links)
- The PSPACE-Completeness of Black-White Pebbling (Q3068646) (← links)
- A Graph Pebbling Algorithm on Weighted Graphs (Q3075605) (← links)
- Pebbling Algorithms in Diameter Two Graphs (Q3563930) (← links)
- Pebbling dynamic graphs in minimal space (Q4365023) (← links)
- (Q4542545) (← links)
- Undirected Graph Exploration with ⊝(log log <i>n</i>) Pebbles (Q4575577) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- Optimal t-rubbling on complete graphs and paths (Q6063837) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)
- Restricted optimal pebbling is NP-hard (Q6611025) (← links)
- On the secure vertex cover pebbling number (Q6650889) (← links)
- On the pebbling numbers of flower, Blanuša and Watkins snarks (Q6657240) (← links)
