Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Suer, Charlie"'
Autor:
Diemunsch, Jennifer, Graber, Nathan, Kramer, Lucas, Larsen, Victor, Nelsen, Lauren M., Nelsen, Luke L., Sigler, Devon, Stolee, Derrick, Suer, Charlie
Publikováno v:
Discrete Applied Mathematics, Volume 225, 10 July 2017, Pages 122-129
Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$. Reorder $\bar{c}(v)$ for every $v$ in $G$ in no
Externí odkaz:
http://arxiv.org/abs/1506.08345
Autor:
Diemunsch, Jennifer, Graber, Nathan, Kramer, Lucas, Larsen, Victor, Nelsen, Lauren M., Nelsen, Luke L., Sigler, Devon, Stolee, Derrick, Suer, Charlie
Publikováno v:
In Discrete Applied Mathematics 10 July 2017 225:122-129
