On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parity
From MaRDI portal
Publication:1625785
DOI10.1016/j.disc.2018.10.009zbMath1400.05157OpenAlexW2899537687MaRDI QIDQ1625785
Publication date: 29 November 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.009
Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- An addition theorem on the integers modulo \(n\)
- Pebbling graphs
- The 2-pebbling property and a conjecture of Graham's
- The pebbling number of \(C_5\times C_5\)
- A Graph Pebbling Algorithm on Weighted Graphs
- Pebbling in diameter two graphs and products of paths
- Graham's pebbling conjecture on products of cycles