A new heuristic for building Weight Function Lemma strategies improves the best-known pebbling-number upper bounds for Blanuša 2 (30 vs 34) and Flower snarks Jm for m ≥ 5.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Weight Function Lemma Heuristic for Graph Pebbling
A new heuristic for building Weight Function Lemma strategies improves the best-known pebbling-number upper bounds for Blanuša 2 (30 vs 34) and Flower snarks Jm for m ≥ 5.