On properties of pebble assignment graphs

DOI10.1007/s00373-021-02453-zzbMath1484.05143OpenAlexW4210727541MaRDI QIDQ2115162

E. Fiorini, M. Lind, Andrew J. Woldar

Publication date: 15 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02453-z

zbMATH Keywords

pebblingfully traversable assignmentpebble assignmentpebble assignment graph

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Cycles and girth in pebble assignment graphs

Cites Work

• General graph pebbling
• An addition theorem on the integers modulo \(n\)
• Computing bounds on product graph pebbling numbers
• Integer-programming bounds on pebbling numbers of Cartesian-product graphs
• Modified linear programming and class 0 bounds for graph pebbling
• On the computational complexity of minimal cumulative cost graph pebbling
• A Graph Pebbling Algorithm on Weighted Graphs
• Pebbling in diameter two graphs and products of paths
• Girth, Pebbling, and Grid Thresholds
• Maximum pebbling number of graphs of diameter three
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On properties of pebble assignment graphs