Degree factors with red-blue coloring of regular graphs (Q6197815)

Summary: Recently, motivated to control a distribution of the vertices having specified degree in a degree factor, the authors introduced a new problem in [Graphs Comb. 39, No. 4, Paper No. 85, 13 p. (2023; Zbl 1529.05129)], which is a degree factor problem of graphs whose vertices are colored with red or blue. In this paper, we continue its research on regular graphs. Among some results, our main theorem is the following: Let \(a, b\) and \(k\) be integers with \(1\leqslant a\leqslant k\leqslant b\leqslant k+a+1\), and let \(r\) be a sufficiently large integer compared to \(a, b\) and \(k\). Let \(G\) be an \(r\)-regular graph. We arbitrarily color every vertex of \(G\) with red or blue so that no two red vertices are adjacent. Then \(G\) has a factor \(F\) such that \(\deg_F(x) \in \{a, b\}\) for every red vertex \(x\) and \(\deg_F(y)\in \{k,k+1\}\) for every blue vertex \(y\).