Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Issad, Asmaa"'
A partition $\pi=\{V_{1},V_{2},...,V_{k}\}$ of the vertex set $V$ of a graph $G$ into $k$ color classes $V_{i}$, with $1\leq i\leq k$ is called a quorum coloring of $G$ if for every vertex $v\in V$, at least half of the vertices in the closed neighbo
Externí odkaz:
http://arxiv.org/abs/2305.03585
