Automating weight function generation in graph pebbling
From MaRDI portal
Publication:6202944
Recommendations
Cites work
- scientific article; zbMATH DE number 1145909 (Why is no real title available?)
- scientific article; zbMATH DE number 1472131 (Why is no real title available?)
- scientific article; zbMATH DE number 5492403 (Why is no real title available?)
- A Graph Pebbling Algorithm on Weighted Graphs
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- A note on graph pebbling
- Doppelgangers and Lemke graphs
- Graham's pebbling conjecture on product of complete bipartite graphs
- Graham's pebbling conjecture on products of many cycles
- Graph pebbling algorithms and Lemke graphs
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Maximum pebbling number of graphs of diameter three
- Modified linear programming and class 0 bounds for graph pebbling
- Pebbling Algorithms in Diameter Two Graphs
- Pebbling and Graham's conjecture
- Pebbling graphs
- Pebbling graphs of diameter three and four
- Pebbling in Hypercubes
- The Complexity of Graph Pebbling
This page was built for publication: Automating weight function generation in graph pebbling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202944)