Characterization of \((2m,m)\)-paintable graphs (Q2344816)

Summary: In this paper, we prove that for any graph \(G\) and any positive integer \(m\), \(G\) is \((2m,m)\)-paintable if and only if \(G\) is 2-paintable. It was asked by \textit{X. Zhu} [Electron. J. Comb. 16, No. 1, Research Paper R127, 16 p. (2009; Zbl 1186.05061)] whether \(k\)-paintable graphs are \((km,m)\)-paintable for any positive integer \(m\). Our result answers this question in the affirmative for \(k=2\).