Using error-correcting codes to construct solvable pebbling distributions

DOI10.1016/j.disc.2015.08.022zbMath1372.94470OpenAlexW1421630180MaRDI QIDQ501069

David Samuel Herscovici

Publication date: 8 October 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.08.022

zbMATH Keywords

coding theoryerror-correcting codespebblingoptimal pebbling

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Burst-correcting codes (94B20)

Related Items (1)

Restricted optimal pebbling and domination in graphs

Cites Work

• Optimally pebbling hypercubes and powers
• A note on optimal pebbling of hypercubes
• Optimal Pebbling in Products of Graphs
• Pebbling in Hypercubes
• Unnamed Item
• Unnamed Item

This page was built for publication: Using error-correcting codes to construct solvable pebbling distributions