Modified linear programming and class 0 bounds for graph pebbling
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0060-6
Abstract: Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move removes two pebbles from some vertex and places one pebble on an adjacent vertex. The pebbling number of a… read more here.
Keywords: graphs; modified linear; class; graph pebbling ... See more keywords