Cycle-Partitions with Specified Vertices and Edges

Hikoe Enomoto1, Hajime Matsumura 2
1Department of Mathematics Hiroshima University Higashi-Hiroshima 739-8526, Japan
2Department of Mathematics Keio University Yokohama 223-8522, Japan

Abstract

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.