Degree-constrained 2-partitions of graphs

Joergen Bang-Jensen, Stéphane Bessy

A $(\delta \ge k_1,\delta \ge k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta (G[V_i])\ge k_i$ for $i=1,2$. We determine, for all positive integers…