Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph

DOI10.1142/S179383091950068XzbMath1427.05145OpenAlexW2976923479WikidataQ123099417 ScholiaQ123099417MaRDI QIDQ5207502

Nopparat Pleanmani

Publication date: 2 January 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091950068x

zbMATH Keywords

complete bipartite graphCartesian product graphgraph pebblingGraham's conjecture

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

A note on pebbling bound for a product of Class 0 graphs ⋮ Bounds for the pebbling number of product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The proof of a conjecture due to Snevily
• Graham's pebbling conjecture on product of complete bipartite graphs
• Pebbling and Graham's conjecture
• The weight function lemma for graph pebbling
• Pebbling in Hypercubes

This page was built for publication: Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph