Graph pebbling algorithms and Lemke graphs

DOI10.1016/J.DAM.2019.02.028MaRDI QIDQ2416420zbMATH OpenOpenAlexWikidataFDO

Authors Charles A. Cusack, Aaron Green, Airat Bekmetjev, Mark Powers

Publication date 23 May 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://digitalcommons.hope.edu/faculty_publications/1486

zbMATH Keywords

algorithmsgraph pebblingLemke graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Doppelgangers and Lemke graphs
• Lemke graphs and Graham's pebbling conjecture
• The complexity of pebbling in diameter two graphs
• The proof of a conjecture due to Snevily
• The complexity of pebbling reachability and solvability in planar and outerplanar graphs

Cites work

• scientific article; zbMATH DE number 1145909 (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
• Lemke graphs and Graham's pebbling conjecture
• Pebbling Algorithms in Diameter Two Graphs
• Pebbling and Graham's conjecture
• Pebbling and optimal pebbling in graphs
• Pebbling graphs
• Pebbling in 2-paths
• Pebbling in Hypercubes
• Pebbling in diameter two graphs and products of paths
• Pebbling in semi-2-trees
• The 2-pebbling property and a conjecture of Graham's
• The Complexity of Graph Pebbling
• The complexity of pebbling in diameter two graphs
• The complexity of pebbling reachability and solvability in planar and outerplanar graphs
• The cover pebbling number of graphs
• The proof of a conjecture due to Snevily
• The weight function lemma for graph pebbling
• t-pebbling and extensions

Cited in

(11)

• The complexity of pebbling reachability and solvability in planar and outerplanar graphs
• The proof of a conjecture due to Snevily
• The weight function lemma for graph pebbling
• Computing bounds on product graph pebbling numbers
• Pebbling Algorithms in Diameter Two Graphs
• The Complexity of Graph Pebbling
• Doppelgangers and Lemke graphs
• A Graph Pebbling Algorithm on Weighted Graphs
• Automating weight function generation in graph pebbling
• Leaps: an approach to the block structure of a graph
• The complexity of pebbling in diameter two graphs

This page was built for publication: Graph pebbling algorithms and Lemke graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2416420)