Pages that link to "Item:Q2410032"
From MaRDI portal
The following pages link to Modified linear programming and class 0 bounds for graph pebbling (Q2410032):
Displaying 6 items.
- On properties of pebble assignment graphs (Q2115162) (← links)
- Computing bounds on product graph pebbling numbers (Q2283021) (← links)
- Cycles and girth in pebble assignment graphs (Q2676758) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)
- Pebbling in Kneser graphs (Q6547946) (← links)
- On the pebbling numbers of flower, Blanuša and Watkins snarks (Q6657240) (← links)