Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Johannes Redl"'
Autor:
Dieter Rautenbach, Johannes Redl
For a graph G, two dominating sets D and D′ in G, and a non-negative integer k, the set D is said to k-transform to D′ if there is a sequence D0,…,Dℓ of dominating sets in G such that D=D0, D′=Dℓ, |Di|≤k for every i∈{0,1,…,ℓ}, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::217eda58241ac67d200e63240a1562dd
