scientific article; zbMATH DE number 1145909
From MaRDI portal
Publication:4386076
zbMATH Open0895.05063MaRDI QIDQ4386076FDOQ4386076
Authors: Lior Pachter, Hunter Snevily, B. Voxman
Publication date: 20 September 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (87)
- The \(t\)-pebbling number of \(C_5\square C_5\)
- Optimal pebbling and rubbling of graphs with given diameter
- Generalizedt-pebbling number of a graph
- The pebbling threshold of the square of cliques
- Graham's pebbling conjecture on products of many cycles
- The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree
- A note on optimal pebbling of hypercubes
- Colored pebble motion on graphs
- The optimal pebbling of spindle graphs
- 2-pebbling property of butterfly-derived graphs
- The proof of a conjecture due to Snevily
- Capacity restricted optimal pebbling in graphs
- The weight function lemma for graph pebbling
- On properties of pebble assignment graphs
- The pebbling number of \(C_5\times C_5\)
- Graham's pebbling conjecture on product of complete bipartite graphs
- Pebbling C5× C5using linear programming
- Modified linear programming and class 0 bounds for graph pebbling
- Pebbling graphs of diameter three and four
- Herscovici's conjecture on \(C_{2 n}\times G \)
- Optimal pebbling on grids
- \(t\)-pebbling and extensions
- The \(t\)-pebbling number of squares of cycles
- Distance restricted optimal pebbling in paths
- On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs
- On the number of reachable configurations for the chessboard pebbling problem
- Optimal pebbling of graphs
- Generalizations of Graham's pebbling conjecture
- Distance restricted optimal pebbling in cycles
- Improved pebbling bounds
- Pebbling numbers of some graphs
- The 2-pebbling property of squares of paths and Graham's conjecture
- Rubbling and optimal rubbling of graphs
- Pebbling number of squares of odd cycles
- The pebbling number of squares of even cycles
- Pebbling in 2-paths
- Pebbling graph products.
- Two-player pebbling on diameter 2 graphs
- Doppelgangers and Lemke graphs
- Pebbling on graph products and other binary graph constructions
- Optimally pebbling hypercubes and powers
- The 2-pebbling property for dense graphs
- Lemke graphs and Graham's pebbling conjecture
- Graph pebbling algorithms and Lemke graphs
- Bounds on the rubbling and optimal rubbling numbers of graphs
- Bounds on the rubbling and optimal rubbling numbers of graphs
- Using error-correcting codes to construct solvable pebbling distributions
- Graham's pebbling conjecture on product of thorn graphs of complete graphs
- Strict optimal rubbling of graphs
- Restricted optimal pebbling and domination in graphs
- Graph pebbling: a blend of graph theory, number theory, and optimization
- Title not available (Why is that?)
- Two-pebbling and odd-two-pebbling are not equivalent
- The optimal pebbling number of staircase graphs
- Optimal pebbling number of graphs with given minimum degree
- General graph pebbling
- The optimal pebbling number of the caterpillar
- Optimal pebbling number of the square grid
- Pebbling in semi-2-trees
- The game of blocking pebbles
- Monophonic pebbling number of some network-related graphs
- On the plurality of graphs
- The \(t\)-pebbling number of Lamp graphs
- The 2-pebbling property of the middle graph of fan graphs
- Critical pebbling numbers of graphs
- Pebbling on the middle graph of a complete binary tree
- Title not available (Why is that?)
- Generalized pebbling number
- Restricted optimal pebbling is NP-hard
- Title not available (Why is that?)
- On the target pebbling conjecture
- Monophonic pebbling number and \(t\)-pebbling number of some graphs
- Pebbling exponents of paths
- Equality of pebbling numbers on directed graphs
- Pebbling number of the graph \(D_{n,C_m}\).
- Automating weight function generation in graph pebbling
- Title not available (Why is that?)
- Cycles and girth in pebble assignment graphs
- Title not available (Why is that?)
- On the pebbling numbers of flower, Blanuša and Watkins snarks
- Pebbling in powers of paths
- Generalized pebbling number
- Pebbling graphs of diameter three and four
- The t-pebbling number of Jahangir graph J3,m
- Pebbling on zig-zag chain graph of \(n\) odd cycles
- On the pebbling numbers of some snarks
- Pebbling in Kneser graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386076)