Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Tatiana Moyer"'
Publikováno v:
SIAM Journal on Discrete Mathematics. 23:1441-1449
Let $S$ be a cyclic $n$-ary sequence. We say that $S$ is a universal cycle ($(n,k)$-Ucycle) for $k$-subsets of $[n]$ if every such subset appears exactly once contiguously in $S$, and is a Ucycle packing if every such subset appears at most once. Few
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a00292288b36563d510c551a7d20ccad
https://doi.org/10.1137/080735795
https://doi.org/10.1137/080735795
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a piece, and hands them to an adversary who distributes them among the vertices of G (called a configuration) and chooses a target vertex r. The player may
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8241fc276fafe413fe05775e151124a8
http://arxiv.org/abs/0811.3238
http://arxiv.org/abs/0811.3238
