Pebbling in diameter two graphs and products of paths
From MaRDI portal
Publication:4344213
DOI<119::AID-JGT3>3.0.CO;2-P 10.1002/(SICI)1097-0118(199706)25:2<119::AID-JGT3>3.0.CO;2-PzbMath0881.05109OpenAlexW2003959728MaRDI QIDQ4344213
T. A. Clarke, Glenn H. Hurlbert, Robert A. Hochberg
Publication date: 22 January 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199706)25:2<119::aid-jgt3>3.0.co;2-p
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph theory (05C99) Connectivity (05C40)
Related Items (24)
On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity ⋮ Bounds on the rubbling and optimal rubbling numbers of graphs ⋮ Pebbling in 2-paths ⋮ \(t\)-pebbling and extensions ⋮ Modified linear programming and class 0 bounds for graph pebbling ⋮ The weight function lemma for graph pebbling ⋮ General graph pebbling ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Cycles and girth in pebble assignment graphs ⋮ Pebbling Graphs of Diameter Three and Four ⋮ On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs ⋮ A note on optimal pebbling of hypercubes ⋮ 1-restricted optimal rubbling on graphs ⋮ The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Pebbling in semi-2-trees ⋮ Pebbling Graphs of Fixed Diameter ⋮ Unnamed Item ⋮ Pebbling on Graph Products and other Binary Graph Constructions ⋮ Graph pegging numbers ⋮ Threshold and complexity results for the cover pebbling game ⋮ The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree ⋮ Optimally pebbling hypercubes and powers ⋮ Pebbling Graphs of Diameter Three and Four ⋮ On properties of pebble assignment graphs
This page was built for publication: Pebbling in diameter two graphs and products of paths
