Pages that link to "Item:Q512538"
From MaRDI portal
The following pages link to Restricted optimal pebbling and domination in graphs (Q512538):
Displaying 7 items.
- 1-restricted optimal rubbling on graphs (Q1717213) (← links)
- Capacity restricted optimal pebbling in graphs (Q1741523) (← links)
- Distance restricted optimal pebbling in cycles (Q2181222) (← links)
- Inapproximability of the standard pebble game and hard to pebble graphs (Q2405292) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- Restricted optimal pebbling is NP-hard (Q6611025) (← links)
- On the secure vertex cover pebbling number (Q6650889) (← links)