Zobrazeno 1 - 10
of 847
pro vyhledávání: '"Godin, Jean"'
We consider the following list coloring with separation problem: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|= a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any ed
Externí odkaz:
http://arxiv.org/abs/2209.03436
Autor:
Godin, Jean-Christophe, Togni, Olivier
We consider the following list coloring with separation problem of graphs: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|\le a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c
Externí odkaz:
http://arxiv.org/abs/2009.00287
Autor:
Godin, Jean-Christophe, Togni, Olivier
A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le a/b\le 3$.
Externí odkaz:
http://arxiv.org/abs/1812.01911
Publikováno v:
In Animal Behaviour December 2022 194:13-33
