Lemke graphs and Graham's pebbling conjecture
From MaRDI portal
Publication:2359974
Recommendations
Cites work
- Graham's pebbling conjecture on product of thorn graphs of complete graphs
- Graham's pebbling conjecture on products of cycles
- Graham's pebbling conjecture on products of many cycles
- scientific article; zbMATH DE number 5542679 (Why is no real title available?)
- scientific article; zbMATH DE number 1145909 (Why is no real title available?)
- On the t-pebbling number and the 2t-pebbling property of graphs
- Pebbling and Graham's conjecture
- Pebbling graphs
- Pebbling in Hypercubes
- The 2-pebbling property and a conjecture of Graham's
- The pebbling number of \(C_5\times C_5\)
- The proof of a conjecture due to Snevily
- The weight function lemma for graph pebbling
Cited in
(10)- Doppelgangers and Lemke graphs
- Two-pebbling and odd-two-pebbling are not equivalent
- The Lemmens-Seidel conjecture and forbidden subgraphs
- Computing bounds on product graph pebbling numbers
- Graph pebbling algorithms and Lemke graphs
- Levinson's theorem for graphs. II
- A pumping lemma for pushdown graphs of any level
- scientific article; zbMATH DE number 5630405 (Why is no real title available?)
- Lollipop and cubic weight functions for graph pebbling
- The proof of a conjecture due to Snevily
This page was built for publication: Lemke graphs and Graham's pebbling conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359974)