Pages that link to "Item:Q2026352"
From MaRDI portal
The following pages link to Optimal pebbling and rubbling of graphs with given diameter (Q2026352):
Displaying 13 items.
- 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)
- The optimal pebbling of spindle graphs (Q2111687) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2376084) (← links)
- Optimal pebbling of graphs (Q2643329) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2857393) (← links)
- Pebbling Algorithms in Diameter Two Graphs (Q3563930) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- Optimal t-rubbling on complete graphs and paths (Q6063837) (← links)
- Strict optimal rubbling of graphs (Q6064866) (← links)