Pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DM 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

A Weight Function Lemma Heuristic for Graph Pebbling

cs.DM · 2025-05-21 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • A Weight Function Lemma Heuristic for Graph Pebbling cs.DM · 2025-05-21 · conditional · none · ref 7

    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.