A relaxation of Steinberg's Conjecture

Owen Hill, Gexin Yu

A graph is $(c_1,c_2,...,c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2,...,V_k$, such that for every $i:1\le i\le k$ the subgraph $G[V_i]$ has…