General graph pebbling
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3124066 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 1104253 (Why is no real title available?)
- scientific article; zbMATH DE number 1145909 (Why is no real title available?)
- scientific article; zbMATH DE number 1998296 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 933467 (Why is no real title available?)
- scientific article; zbMATH DE number 1439473 (Why is no real title available?)
- scientific article; zbMATH DE number 3387622 (Why is no real title available?)
- scientific article; zbMATH DE number 2214416 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- scientific article; zbMATH DE number 3102822 (Why is no real title available?)
- A combinatorial problem on finite Abelian groups. I
- A generalization of a combinatorial theorem of macaulay
- A note on graph pebbling
- An addition theorem on the integers modulo \(n\)
- An improved upper bound for the pebbling threshold of the \(n\)-path
- Cover pebbling hypercubes
- Cover pebbling numbers and bounds for certain families of graphs
- Domination cover pebbling: graph families
- Girth, Pebbling, and Grid Thresholds
- Graham's pebbling conjecture on product of complete bipartite graphs
- Graham's pebbling conjecture on products of cycles
- Graham's pebbling conjecture on products of many cycles
- Hamiltonian uniform subset graphs
- Improved pebbling bounds
- Maximum pebbling number of graphs of diameter three
- On Davenport's constant
- On Davenport's constant of finite Abelian groups with rank three
- On Existence of Distinct Representative Sets for Subsets of a Finite Set
- On Pebbling Graphs by Their Blocks
- On a Result of Lemke and Kleitman
- On a conjecture of Kleitman and Lemke
- On pebbling threshold functions for graph sequences
- On the pebbling threshold of paths and the pebbling threshold spectrum
- On the structure of sequences with forbidden zero-sum subsequences
- Optimal pebbling in products of graphs
- Optimally pebbling hypercubes and powers
- Pebbling and optimal pebbling in graphs
- Pebbling graph products.
- Pebbling graphs
- Pebbling in Hypercubes
- Pebbling in diameter two graphs and products of paths
- Pebbling numbers of some graphs
- Regular subgraphs of almost regular graphs
- The Complexity of Graph Pebbling
- The cover pebbling number of graphs
- The cover pebbling theorem
- The optimal pebbling number of the complete \(m\)-ary tree
- The pebbling number of \(C_5\times C_5\)
- The pebbling threshold of the square of cliques
- The weight function lemma for graph pebbling
- There are infinitely many Carmichael numbers
- Threshold functions
- Thresholds for families of multisets, with an application to graph pebbling
- Thresholds for random distributions on graph sequences with applications to pebbling
- Unification of zero-sum problems, subset sums and covers of ℤ
- Weighted sums in finite cyclic groups
- Zero-sum problems -- a survey
- Zero-sum problems and coverings by proper cosets
Cited in
(17)- The weight function lemma for graph pebbling
- Zero-sum problems in finite Abelian groups: a survey
- Two-player pebbling on diameter 2 graphs
- Doppelgangers and Lemke graphs
- On properties of pebble assignment graphs
- On the pebbling numbers of flower, Blanuša and Watkins snarks
- Pebbling in powers of paths
- On the secure vertex cover pebbling number
- On the target pebbling conjecture
- Counterexamples to a monotonicity conjecture for the threshold pebbling number
- The Complexity of Graph Pebbling
- Pebbling in semi-2-trees
- Treasure hunt in graph using pebbles
- Cycles and girth in pebble assignment graphs
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs
- Graph pebbling: a blend of graph theory, number theory, and optimization
- Pebbling in Split Graphs
This page was built for publication: General graph pebbling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385150)
