The proof of a conjecture due to Snevily

DOI10.1016/J.DISC.2010.02.008zbMATH Open1225.05181OpenAlexW2107479896WikidataQ123252530 ScholiaQ123252530MaRDI QIDQ968439FDOQ968439

Jian-Hua Yin, Ze-Tu Gao

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

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

zbMATH Keywords

pebbling numberSnevily conjectureLemke graph

Mathematics Subject Classification ID

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

Cites Work

• Pebbling in Hypercubes
• Pebbling graphs
• Title not available (Why is that?)
• Pebbling and optimal pebbling in graphs
• Graham's pebbling conjecture on products of cycles
• The pebbling number of \(C_5\times C_5\)
• The 2-pebbling property and a conjecture of Graham's
• Pebbling and Graham's conjecture

Cited In (8)

• The \(t\)-pebbling number of \(C_5\square C_5\)
• A Sneaky Proof of the Maximum Modulus Principle
• Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph
• Doppelgangers and Lemke graphs
• Lemke graphs and Graham's pebbling conjecture
• Graph pebbling algorithms and Lemke graphs
• Title not available (Why is that?)
• 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)