Pages that link to "Item:Q3075605"
From MaRDI portal
The following pages link to A Graph Pebbling Algorithm on Weighted Graphs (Q3075605):
Displaying 11 items.
- On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity (Q1625785) (← links)
- On properties of pebble assignment graphs (Q2115162) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2376084) (← 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)
- The cover pebbling theorem (Q2583674) (← links)
- Cycles and girth in pebble assignment graphs (Q2676758) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2857393) (← links)
- Weighted pebbling numbers on graphs (Q5267508) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)