The proof of a conjecture due to Snevily

DOI10.1016/j.disc.2010.02.008zbMath1225.05181OpenAlexW2107479896WikidataQ123252530 ScholiaQ123252530MaRDI QIDQ968439

Ze-Tu Gao, Jian Hua Yin

Publication date: 5 May 2010

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

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

zbMATH Keywords

pebbling numberSnevily conjectureLemke graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Lemke graphs and Graham's pebbling conjecture ⋮ Doppelgangers and Lemke graphs ⋮ The \(t\)-pebbling number of \(C_5\square C_5\) ⋮ Graph pebbling algorithms and Lemke graphs ⋮ Two-pebbling and odd-two-pebbling are not equivalent ⋮ Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph

Cites Work

• Unnamed Item
• Pebbling graphs
• The 2-pebbling property and a conjecture of Graham's
• The pebbling number of \(C_5\times C_5\)
• Pebbling and Graham's conjecture
• Pebbling in Hypercubes
• Graham's pebbling conjecture on products of cycles
• Pebbling and optimal pebbling in graphs

This page was built for publication: The proof of a conjecture due to Snevily