Pages that link to "Item:Q1402065"
From MaRDI portal
The following pages link to Thresholds for families of multisets, with an application to graph pebbling (Q1402065):
Displaying 9 items.
- General graph pebbling (Q385150) (← links)
- Counterexamples to a monotonicity conjecture for the threshold pebbling number (Q442335) (← links)
- On the pebbling threshold of paths and the pebbling threshold spectrum (Q932604) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- Threshold and complexity results for the cover pebbling game (Q1025557) (← links)
- An improved upper bound for the pebbling threshold of the \(n\)-path (Q1420621) (← links)
- The weight function lemma for graph pebbling (Q2410088) (← links)
- Cover Pebbling Thresholds for the Complete Graph (Q3439355) (← links)
- On the secure vertex cover pebbling number (Q6650889) (← links)
