Automating weight function generation in graph pebbling

DOI10.1016/J.DAM.2023.12.022arXiv2312.12618OpenAlexW4391018647MaRDI QIDQ6202944FDOQ6202944

Authors: Dominic Flocco, Jonad Pulaj, Carl Yerger 

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

Recommendations

• The weight function lemma for graph pebbling
• Computing bounds on product graph pebbling numbers
• A Graph Pebbling Algorithm on Weighted Graphs
• The Complexity of Graph Pebbling
• Integer-programming bounds on pebbling numbers of Cartesian-product graphs

zbMATH Keywords

combinatorial optimizationgraph theoryinteger programmingpebbling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites Work

• Pebbling in Hypercubes
• Pebbling graphs
• Title not available (Why is that?)
• The Complexity of Graph Pebbling
• Title not available (Why is that?)
• Pebbling Algorithms in Diameter Two Graphs
• Maximum pebbling number of graphs of diameter three
• A note on graph pebbling
• Graham's pebbling conjecture on product of complete bipartite graphs
• Graham's pebbling conjecture on products of many cycles
• Pebbling and Graham's conjecture
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• A Graph Pebbling Algorithm on Weighted Graphs
• Doppelgangers and Lemke graphs
• Graph pebbling algorithms and Lemke graphs
• Title not available (Why is that?)
• Integer-programming bounds on pebbling numbers of Cartesian-product graphs
• Modified linear programming and class 0 bounds for graph pebbling
• Pebbling graphs of diameter three and four

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)