The following pages link to Pebbling graphs (Q1204476):
Displayed 38 items.
- The optimal rubbling number of ladders, prisms and Möbius-ladders (Q298981) (← links)
- General graph pebbling (Q385150) (← links)
- The \(t\)-pebbling number of \(C_5\square C_5\) (Q394223) (← links)
- Generalizations of Graham's pebbling conjecture (Q442315) (← links)
- Pebbling number of squares of odd cycles (Q456657) (← links)
- The pebbling number of squares of even cycles (Q456661) (← links)
- Herscovici's conjecture on the product of the thorn graphs of the complete graphs (Q489118) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- The proof of a conjecture due to Snevily (Q968439) (← links)
- Graham's pebbling conjecture on products of many cycles (Q998388) (← links)
- Graham's pebbling conjecture on product of thorn graphs of complete graphs (Q1025977) (← links)
- Rubbling and optimal rubbling of graphs (Q1025979) (← links)
- The pebbling number of \(C_5\times C_5\) (Q1584299) (← links)
- Graham's pebbling conjecture on product of complete bipartite graphs (Q1609686) (← links)
- On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity (Q1625785) (← links)
- Doppelgangers and Lemke graphs (Q1660246) (← links)
- Two-pebbling and odd-two-pebbling are not equivalent (Q1712521) (← links)
- The 2-pebbling property for dense graphs (Q1940887) (← links)
- On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs (Q1949104) (← links)
- A note on optimal pebbling of hypercubes (Q1956255) (← links)
- Optimal pebbling number of the square grid (Q2175808) (← links)
- The 2-pebbling property of squares of paths and Graham's conjecture (Q2189217) (← links)
- Computing bounds on product graph pebbling numbers (Q2283021) (← links)
- Lemke graphs and Graham's pebbling conjecture (Q2359974) (← links)
- Modified linear programming and class 0 bounds for graph pebbling (Q2410032) (← links)
- Graph pebbling algorithms and Lemke graphs (Q2416420) (← links)
- Improved pebbling bounds (Q2483419) (← links)
- The cover pebbling number of graphs (Q2484366) (← links)
- Pebbling numbers of some graphs (Q2503771) (← links)
- Pebbling in powers of paths (Q2689489) (← links)
- Pebbling C<sub>5</sub>× C<sub>5</sub>using linear programming (Q2766129) (← links)
- Pebbling on zig-zag chain graph of n odd cycles (Q3295018) (← links)
- The t-pebbling number of Jahangir graph J3,m (Q3460031) (← links)
- Generalized<i>t</i>-pebbling number of a graph (Q3634015) (← links)
- Pebbling on Graph Products and other Binary Graph Constructions (Q4616105) (← links)
- Herscovici’s conjecture on C2n × G (Q5858181) (← links)
- Strict optimal rubbling of graphs (Q6064866) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)