On properties of pebble assignment graphs

DOI10.1007/S00373-021-02453-ZzbMATH Open1484.05143OpenAlexW4210727541MaRDI QIDQ2115162FDOQ2115162

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

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

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.

zbMATH Keywords

pebblingfully traversable assignmentpebble assignmentpebble assignment graph

Mathematics Subject Classification ID

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

Cites Work

• An addition theorem on the integers modulo \(n\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pebbling in diameter two graphs and products of paths
• Maximum pebbling number of graphs of diameter three
• General graph pebbling
• Girth, Pebbling, and Grid Thresholds
• Title not available (Why is that?)
• On the computational complexity of minimal cumulative cost graph pebbling
• A Graph Pebbling Algorithm on Weighted Graphs
• 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

Cited In (3)

• Generalized impartial two-player pebbling games on \(K_3\) and \(C_4\)
• Colored pebble motion on graphs (extended abstract)
• 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)