Pages that link to "Item:Q3563930"
From MaRDI portal
The following pages link to Pebbling Algorithms in Diameter Two Graphs (Q3563930):
Displaying 8 items.
- \(t\)-pebbling and extensions (Q354409) (← links)
- Pebbling in semi-2-trees (Q526223) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- The weight function lemma for graph pebbling (Q2410088) (← links)
- Graph pebbling algorithms and Lemke graphs (Q2416420) (← links)
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs (Q2449128) (← links)
- A Graph Pebbling Algorithm on Weighted Graphs (Q3075605) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)