Zobrazeno 1 - 3
of 3
pro vyhledávání: '"t-restricted optimal pebbling"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 2, Pp 575-588 (2019)
Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble fr
Externí odkaz:
https://doaj.org/article/8356c4f794c44b2f8ae1c2bb70002fb8
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 2, Pp 575-588 (2019)
Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1d1e7c06d20fb58a047795ac4106305
https://doaj.org/article/8356c4f794c44b2f8ae1c2bb70002fb8
https://doaj.org/article/8356c4f794c44b2f8ae1c2bb70002fb8
Publikováno v:
ETSU Faculty Works.
Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble fr
Externí odkaz:
https://dc.etsu.edu/etsu-works/10065