Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Sharbel, Gabriel"'
Autor:
Bennett, Timothy, Bowdoin, Michael C., Broadus, Haley, Hodgins, Daniel, Mudrock, Jeffrey A., Nusair, Adam K., Sharbel, Gabriel, Silverman, Joshua
Suppose $G$ is a graph and $L$ is a list assignment for $G$. A request of $L$ is a function $r$ with nonempty domain $D\subseteq V(G)$ such that $r(v) \in L(v)$ for each $v \in D$. The triple $(G,L,r)$ is $\epsilon$-satisfiable if there exists a prop
Externí odkaz:
http://arxiv.org/abs/2412.15927
Autor:
Mudrock, Jeffrey A., Sharbel, Gabriel
DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was introduced
Externí odkaz:
http://arxiv.org/abs/2407.04807