On properties of pebble assignment graphs

DOI10.1007/S00373-021-02453-ZMaRDI QIDQ2115162zbMATH OpenOpenAlexFDO

Authors M. Lind, E. Fiorini, 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 on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1145909
• The cover pebbling number of graphs
• General graph pebbling
• Cycles and girth in pebble assignment graphs
• Pebbling graph products.

Cites work

• scientific article; zbMATH DE number 1145909 (Why is no real title available?)
• scientific article; zbMATH DE number 2170575 (Why is no real title available?)
• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• A Graph Pebbling Algorithm on Weighted Graphs
• An addition theorem on the integers modulo \(n\)
• Computing bounds on product graph pebbling numbers
• General graph pebbling
• Girth, Pebbling, and Grid Thresholds
• Integer-programming bounds on pebbling numbers of Cartesian-product graphs
• Maximum pebbling number of graphs of diameter three
• Modified linear programming and class 0 bounds for graph pebbling
• On the computational complexity of minimal cumulative cost graph pebbling
• Pebbling in diameter two graphs and products of paths

Cited in

(5)

• Multi-color pebble motion on graphs
• Pebble exchange group of graphs
• Colored pebble motion on graphs (extended abstract)
• Generalized impartial two-player pebbling games on \(K_3\) and \(C_4\)
• Cycles and girth in pebble assignment graphs

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

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