Pages that link to "Item:Q1579551"

The following pages link to The optimal pebbling number of the complete \(m\)-ary tree (Q1579551):

Displaying 14 items.

• General graph pebbling (Q385150) (← links)
• Restricted optimal pebbling and domination in graphs (Q512538) (← links)
• Rubbling and optimal rubbling of graphs (Q1025979) (← links)
• 1-restricted optimal rubbling on graphs (Q1717213) (← 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)
• 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)
• Distance restricted optimal pebbling in cycles (Q2181222) (← links)
• The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree (Q2317614) (← links)
• The optimal pebbling number of staircase graphs (Q2421883) (← links)