Pages that link to "Item:Q5207502"

The following pages link to Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph (Q5207502):

Displaying 2 items.

• A note on pebbling bound for a product of Class 0 graphs (Q5064377) (← links)
• Bounds for the pebbling number of product graphs (Q5104010) (← links)