Target pebbling in trees

DOI10.1016/J.DISC.2026.115029MaRDI QIDQ6835838zbMATH OpenFDO

Authors Matheus Adauto, Yunus Bidav, Glenn H. Hurlbert

Publication date 30 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115029

zbMATH Keywords

graph pebblingpathstarget pebblingtrees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites work

• t-pebbling and extensions
• A note on graph pebbling
• Generalizations of Graham's pebbling conjecture
• Graph pebbling: a blend of graph theory, number theory, and optimization
• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• scientific article; zbMATH DE number 1998296 (Why is no real title available?)
• Improved pebbling bounds
• On the target pebbling conjecture
• Pebbling and optimal pebbling in graphs
• Pebbling graphs
• Pebbling in diameter two graphs and products of paths
• Pebbling in Hypercubes
• Pebbling in powers of paths
• Pebbling in semi-2-trees
• Pebbling in Split Graphs
• The Complexity of Graph Pebbling
• The complexity of pebbling in diameter two graphs
• The complexity of pebbling reachability and solvability in planar and outerplanar graphs
• The cover pebbling number of graphs
• The cover pebbling theorem

This page was built for publication: Target pebbling in trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835838)