General graph pebbling
From MaRDI portal
Publication:385150
DOI10.1016/j.dam.2012.03.010zbMath1277.05157OpenAlexW1982886989MaRDI QIDQ385150
Publication date: 29 November 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.010
Related Items (10)
Zero-sum problems in finite Abelian groups: a survey ⋮ Doppelgangers and Lemke graphs ⋮ The weight function lemma for graph pebbling ⋮ Cycles and girth in pebble assignment graphs ⋮ Pebbling in powers of paths ⋮ Counterexamples to a monotonicity conjecture for the threshold pebbling number ⋮ The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Pebbling in semi-2-trees ⋮ Two-player pebbling on diameter 2 graphs ⋮ On properties of pebble assignment graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular subgraphs of almost regular graphs
- On the pebbling threshold of paths and the pebbling threshold spectrum
- The pebbling threshold of the square of cliques
- Graham's pebbling conjecture on products of many cycles
- Hamiltonian uniform subset graphs
- Threshold functions
- An addition theorem on the integers modulo \(n\)
- On Davenport's constant
- Pebbling graphs
- There are infinitely many Carmichael numbers
- Zero-sum problems and coverings by proper cosets
- Thresholds for families of multisets, with an application to graph pebbling
- An improved upper bound for the pebbling threshold of the \(n\)-path
- The optimal pebbling number of the complete \(m\)-ary tree
- On Davenport's constant of finite Abelian groups with rank three
- The pebbling number of \(C_5\times C_5\)
- Optimally pebbling hypercubes and powers
- On pebbling threshold functions for graph sequences
- A note on graph pebbling
- Graham's pebbling conjecture on product of complete bipartite graphs
- On a conjecture of Kleitman and Lemke
- Weighted sums in finite cyclic groups
- Thresholds for random distributions on graph sequences with applications to pebbling
- Zero-sum problems -- a survey
- The weight function lemma for graph pebbling
- Improved pebbling bounds
- The cover pebbling number of graphs
- Pebbling numbers of some graphs
- A combinatorial problem on finite Abelian groups. I
- The cover pebbling theorem
- Optimal Pebbling in Products of Graphs
- On a Result of Lemke and Kleitman
- On Pebbling Graphs by Their Blocks
- Pebbling in Hypercubes
- Pebbling in diameter two graphs and products of paths
- Unification of zero-sum problems, subset sums and covers of ℤ
- Graham's pebbling conjecture on products of cycles
- On the structure of sequences with forbidden zero-sum subsequences
- Pebbling and optimal pebbling in graphs
- Girth, Pebbling, and Grid Thresholds
- Maximum pebbling number of graphs of diameter three
- A generalization of a combinatorial theorem of macaulay
- On Existence of Distinct Representative Sets for Subsets of a Finite Set
- The Complexity of Graph Pebbling
This page was built for publication: General graph pebbling
