Pages that link to "Item:Q5450348"

The following pages link to Pebbling and optimal pebbling in graphs (Q5450348):

Displaying 40 items.

• Optimal pebbling on grids (Q293664) (← links)
• The optimal rubbling number of ladders, prisms and Möbius-ladders (Q298981) (← links)
• \(t\)-pebbling and extensions (Q354409) (← links)
• General graph pebbling (Q385150) (← links)
• Restricted optimal pebbling and domination in graphs (Q512538) (← links)
• Pebbling in semi-2-trees (Q526223) (← links)
• The proof of a conjecture due to Snevily (Q968439) (← links)
• Rubbling and optimal rubbling of graphs (Q1025979) (← links)
• Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
• An improved upper bound for the pebbling threshold of the \(n\)-path (Q1420621) (← links)
• The optimal pebbling number of the complete \(m\)-ary tree (Q1579551) (← links)
• Optimally pebbling hypercubes and powers (Q1584396) (← links)
• Doppelgangers and Lemke graphs (Q1660246) (← 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)
• Distance restricted optimal pebbling in paths (Q2022505) (← 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)
• The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree (Q2317614) (← 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)
• 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)
• Optimal pebbling of graphs (Q2643329) (← links)
• Pebbling in powers of paths (Q2689489) (← links)
• Colored pebble motion on graphs (extended abstract) (Q2851461) (← links)
• Bounds on the rubbling and optimal rubbling numbers of graphs (Q2857393) (← 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)
• The Complexity of Graph Pebbling (Q5757392) (← links)
• Optimal t-rubbling on complete graphs and paths (Q6063837) (← links)
• Strict optimal rubbling of graphs (Q6064866) (← links)
• Pebble minimization: the last theorems (Q6091210) (← links)
• Restricted optimal pebbling is NP-hard (Q6611025) (← links)
• On the secure vertex cover pebbling number (Q6650889) (← links)