论文信息 - Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14 - 字舞流文

Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14

In this paper we completely settle the embedding problem for m-cycle systems with m less than or equal to 14. We also solve the more general problem of finding m-cycle systems of K-v - K-u when m is an element of {4,6,7,8,10,12,14}.

Christopher A. Rodger | Darryn E. Bryant | Erin R. Spicer

[1] Richard M. Wilson,et al. Embeddings of Steiner triple systems , 1973, Discret. Math..

[2] Dean G. Hoffman,et al. The chromatic index of complete multipartite graphs , 1992, J. Graph Theory.

[3] Christopher A. Rodger,et al. The Doyen-Wilson Theorem Extended to 5-Cycles , 1994, J. Comb. Theory, Ser. A.

[4] Dominique Sotteau. Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k , 1981, J. Comb. Theory, Ser. B.

[5] Renu C. Laskar,et al. Chromatic Numbers for Certain Graphs , 1972 .

[6] Christopher A. Rodger,et al. On the doyen‐wilson theorem for m‐cycle systems , 1994 .

[7] J. A. Bondy,et al. Graph Theory with Applications , 1978 .