Cycle Coloring and 2-Factorizations of KV

Abstract:

Article Preview

This paper give a definition of edge matrix and cycle coloring with complete graph , and also a construction of the theorem for n Hamilton. Clarify the basic ideas of 2-factorizations with complete graph, and proof the theorem of 2-factorization. After that, we show the whole process of the complete graphs 2-factorization for K10 and K17, when it is that n=5 and n=8. We obtain the edge matrix of the K17 and edge sets for 8 Hamilton. Finally, it can be test and verify the construction of theorem with n Hamilton, and theorem of 2-factorizations is a simple and feasible effectiveness method.

Info:

Periodical:

Advanced Materials Research (Volumes 204-210)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

1934-1937

DOI:

10.4028/www.scientific.net/AMR.204-210.1934

Citation:

X. Y. Li et al., "Cycle Coloring and 2-Factorizations of KV", Advanced Materials Research, Vols. 204-210, pp. 1934-1937, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.