scientific article; zbMATH DE number 1439473

MaRDI QIDQ4949852zbMATH OpenFDO

Authors Glenn H. Hurlbert

Publication date 20 February 2001

Full work available at URL https://arxiv.org/abs/math/0406024

zbMATH Keywords

LYM inequalitypebbling numberssupernormal posetsurveythreshold function

Mathematics Subject Classification ID

Graph theory (05C99) Extremal set theory (05D05) Combinatorics of partially ordered sets (06A07) Other combinatorial number theory (11B75) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1145909
• Girth, Pebbling, and Grid Thresholds
• Thresholds for families of multisets, with an application to graph pebbling

Cited in

(59)

• Graph pegging numbers
• Threshold and complexity results for the cover pebbling game
• Rubbling and optimal rubbling of graphs
• Maximum orbit weights in the -game and lit-only -game on grids and graphs
• Thresholds for families of multisets, with an application to graph pebbling
• An improved upper bound for the pebbling threshold of the n-path
• Domination cover rubbling
• Thresholds for random distributions on graph sequences with applications to pebbling
• Token graphs
• On an inverse problem of Erdős, Kleitman, and Lemke
• Two-player pebbling on diameter 2 graphs
• On properties of pebble assignment graphs
• Cover rubbling and stacking
• The optimal t-pebbling number of a certain complete m-ary tree
• Bounds on the rubbling and optimal rubbling numbers of graphs
• Modified linear programming and class 0 bounds for graph pebbling
• The weight function lemma for graph pebbling
• Improved pebbling bounds
• The cover pebbling number of graphs
• Optimal pebbling of graphs
• Pebbling graphs of diameter three and four
• Colored pebble motion on graphs (extended abstract)
• Bounds on the rubbling and optimal rubbling numbers of graphs
• Optimal pebbling on grids
• The optimal rubbling number of ladders, prisms and Möbius-ladders
• A Graph Pebbling Algorithm on Weighted Graphs
• The game of blocking pebbles
• Cover Pebbling Thresholds for the Complete Graph
• General graph pebbling
• Pebbling dynamic graphs in minimal space
• Generalizations of Graham's pebbling conjecture
• Counterexamples to a monotonicity conjecture for the threshold pebbling number
• scientific article; zbMATH DE number 1775412 (Why is no real title available?)
• On a combinatorial problem of Erdős, Kleitman and Lemke
• Undirected Graph Exploration with ⊝(log log n) Pebbles
• scientific article; zbMATH DE number 7021370 (Why is no real title available?)
• Pebbling graphs of diameter three and four
• SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS
• Monophonic pebbling number and t-pebbling number of some graphs
• Beyond NP: quantifying over answer sets
• Pebbling graphs of fixed diameter
• The Complexity of Graph Pebbling
• On the 2-Token Graphs of Some Disjoint Union of Graphs
• Maximal matching cover pebbling number for variants of hypercube
• Herscovici’s Conjecture on Product of Some Complete Bipartite Graphs
• Pebbling in Kneser graphs
• Monophonic pebbling number of some network-related graphs
• NDC pebbling number for some class of graphs
• Pebbling number and 2-pebbling property for the middle graphs of the graph obtained from fan graph by deleting \(f\) independent edges
• On binary DCP labeling
• Monophonic pebbling number of some families of cycles
• On the secure vertex cover pebbling number
• On the pebbling numbers of flower, Blanuša and Watkins snarks
• Thresholds for pebbling on grids
• Monophonic cover pebbling number (MCPN) of network graphs
• The monophonic pebbling number of neural networks with generalized algorithm and their applications
• Connect four on trees
• On the pebbling threshold of paths and the pebbling threshold spectrum
• The pebbling threshold of the square of cliques

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 Q4949852)