Pebbling Algorithms in Diameter Two Graphs

DOI10.1137/080724277zbMath1191.05083OpenAlexW2009321501MaRDI QIDQ3563930

Charles A. Cusack, Airat Bekmetjev

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080724277

zbMATH Keywords

algorithmsdiameterconnectivitygraph pebbling

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (6)

\(t\)-pebbling and extensions ⋮ The weight function lemma for graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Automating weight function generation in graph pebbling ⋮ The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Pebbling in semi-2-trees

This page was built for publication: Pebbling Algorithms in Diameter Two Graphs