In this paper, we consider cycle-partition problems which deal with the case when both vertices and edges are specified and we require that they should belong to different cycles. Minimum degree and degree sum conditions are given, which are best possible.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.