The Complexity of Pebbling in Diameter Two Graphs
From MaRDI portal
Publication:4899034
DOI10.1137/11084412XzbMath1258.68066MaRDI QIDQ4899034
Charles A. Cusack, Samuel Taggart, Timothy Lewis, Daniel P. Simpson
Publication date: 4 January 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Pebbling in 2-paths ⋮ The weight function lemma for graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Pebbling in semi-2-trees
This page was built for publication: The Complexity of Pebbling in Diameter Two Graphs
