A relaxation of the strong Bordeaux Conjecture

Ziwen Huang, Xiangwen Li, Gexin Yu

Let $c_1,c_2,\cdots ,c_k$ be $k$ non-negative integers. A graph $G$ is $(c_1,c_2,\cdots ,c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, \ldots, V_…