The proof of a conjecture due to Snevily

DOI10.1016/J.DISC.2010.02.008MaRDI QIDQ968439zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Lemke graphs and Graham's pebbling conjecture
• Doppelgangers and Lemke graphs
• The 2-pebbling property for dense graphs
• The 2-pebbling property and a conjecture of Graham's
• Graph pebbling algorithms and Lemke graphs

Cites work

• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• Graham's pebbling conjecture on products of cycles
• Pebbling and Graham's conjecture
• Pebbling and optimal pebbling in graphs
• Pebbling graphs
• Pebbling in Hypercubes
• The 2-pebbling property and a conjecture of Graham's
• The pebbling number of \(C_5\times C_5\)

Cited in

(9)

• The t-pebbling number of C₅ C₅
• A Sneaky Proof of the Maximum Modulus Principle
• Doppelgangers and Lemke graphs
• The 2-pebbling property for dense graphs
• Lemke graphs and Graham's pebbling conjecture
• Graph pebbling algorithms and Lemke graphs
• scientific article; zbMATH DE number 3870116 (Why is no real title available?)
• Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
• Two-pebbling and odd-two-pebbling are not equivalent

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968439)