Automating weight function generation in graph pebbling
From MaRDI portal
Publication:6202944
DOI10.1016/j.dam.2023.12.022arXiv2312.12618OpenAlexW4391018647MaRDI QIDQ6202944
Dominic Flocco, Carl R. Yerger, Jonad Pulaj
Publication date: 27 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2312.12618
Integer programming (90C10) Games involving graphs (91A43) Combinatorial optimization (90C27) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- Graham's pebbling conjecture on products of many cycles
- Pebbling graphs
- A note on graph pebbling
- Graham's pebbling conjecture on product of complete bipartite graphs
- Doppelgangers and Lemke graphs
- Pebbling and Graham's conjecture
- Integer-programming bounds on pebbling numbers of Cartesian-product graphs
- Modified linear programming and class 0 bounds for graph pebbling
- Graph pebbling algorithms and Lemke graphs
- A Graph Pebbling Algorithm on Weighted Graphs
- Pebbling in Hypercubes
- Pebbling Algorithms in Diameter Two Graphs
- Pebbling Graphs of Diameter Three and Four
- Maximum pebbling number of graphs of diameter three
- The Complexity of Graph Pebbling
This page was built for publication: Automating weight function generation in graph pebbling
