On properties of pebble assignment graphs
type: Item
instance of: scholarly article
title: On properties of pebble assignment graphs
zbMATH Open document ID: 1484.05143
author: M. Lind
author: E. Fiorini
author: Andrew J. Woldar
published in: Graphs and Combinatorics
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 7490318
zbMATH Keywords: pebbling
zbMATH Keywords: pebble assignment
zbMATH Keywords: pebble assignment graph
zbMATH Keywords: fully traversable assignment
MaRDI profile type: Publication
full work available at URL: s00373-021-02453-z
OpenAlex ID: W4210727541
cites work: Q4678058
cites work: On the computational complexity of minimal cumulative cost graph pebbling
cites work: Maximum pebbling number of graphs of diameter three
cites work: Pebbling in diameter two graphs and products of paths
cites work: Modified linear programming and class 0 bounds for graph pebbling
cites work: Girth, Pebbling, and Grid Thresholds
cites work: Q4949852
cites work: General graph pebbling
cites work: Integer-programming bounds on pebbling numbers of Cartesian-product graphs
cites work: Computing bounds on product graph pebbling numbers
cites work: An addition theorem on the integers modulo \(n\)
cites work: Q4386076
cites work: A Graph Pebbling Algorithm on Weighted Graphs
DOI: 10.1007/S00373-021-02453-Z
description: scientific article; zbMATH DE number 7490318