Pages that link to "Item:Q968439"
From MaRDI portal
The following pages link to The proof of a conjecture due to Snevily (Q968439):
Displaying 9 items.
- The \(t\)-pebbling number of \(C_5\square C_5\) (Q394223) (← links)
- Doppelgangers and Lemke graphs (Q1660246) (← links)
- Two-pebbling and odd-two-pebbling are not equivalent (Q1712521) (← links)
- The 2-pebbling property for dense graphs (Q1940887) (← links)
- Lemke graphs and Graham's pebbling conjecture (Q2359974) (← links)
- Graph pebbling algorithms and Lemke graphs (Q2416420) (← links)
- A Sneaky Proof of the Maximum Modulus Principle (Q2847002) (← links)
- (Q3336287) (← links)
- Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph (Q5207502) (← links)