scientific article; zbMATH DE number 1439473
From MaRDI portal
Publication:4949852
zbMath0961.05067arXivmath/0406024MaRDI QIDQ4949852
Publication date: 20 February 2001
Full work available at URL: https://arxiv.org/abs/math/0406024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05) Other combinatorial number theory (11B75) Graph theory (05C99)
Related Items (39)
Optimal pebbling on grids ⋮ The optimal rubbling number of ladders, prisms and Möbius-ladders ⋮ Bounds on the rubbling and optimal rubbling numbers of graphs ⋮ Optimal pebbling of graphs ⋮ SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS ⋮ Modified linear programming and class 0 bounds for graph pebbling ⋮ The weight function lemma for graph pebbling ⋮ General graph pebbling ⋮ Token graphs ⋮ Monophonic pebbling number and t-pebbling number of some graphs ⋮ Beyond NP: Quantifying over Answer Sets ⋮ Pebbling Graphs of Diameter Three and Four ⋮ On the 2-Token Graphs of Some Disjoint Union of Graphs ⋮ Maximal matching cover pebbling number for variants of hypercube ⋮ Cover rubbling and stacking ⋮ Herscovici’s Conjecture on Product of Some Complete Bipartite Graphs ⋮ Generalizations of Graham's pebbling conjecture ⋮ Counterexamples to a monotonicity conjecture for the threshold pebbling number ⋮ An improved upper bound for the pebbling threshold of the \(n\)-path ⋮ On a combinatorial problem of Erdős, Kleitman and Lemke ⋮ Unnamed Item ⋮ On the pebbling threshold of paths and the pebbling threshold spectrum ⋮ The pebbling threshold of the square of cliques ⋮ Domination cover rubbling ⋮ Pebbling Graphs of Fixed Diameter ⋮ Improved pebbling bounds ⋮ On an inverse problem of Erdős, Kleitman, and Lemke ⋮ The cover pebbling number of graphs ⋮ Unnamed Item ⋮ Two-player pebbling on diameter 2 graphs ⋮ Graph pegging numbers ⋮ Threshold and complexity results for the cover pebbling game ⋮ Rubbling and optimal rubbling of graphs ⋮ The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs ⋮ Unnamed Item ⋮ Pebbling Graphs of Diameter Three and Four ⋮ Cover Pebbling Thresholds for the Complete Graph ⋮ On properties of pebble assignment graphs
This page was built for publication:
