论文信息 - Maximal sets of Hamilton cycles in Dn - 字舞流文

Maximal sets of Hamilton cycles in Dn

In this paper, we prove that there exists a maximal set of m directed Hamilton cycles in D"n if and only if @?n/[email protected]?==7.

Hao Shen | Liqun Pu | Hung-Lin Fu | H. Fu | Hao Shen | Liqun Pu

[1] Xuding Zhu,et al. The circular chromatic number of series-parallel graphs , 2000, Journal of Graph Theory.

[2] Christopher A. Rodger,et al. Maximal sets of hamilton cycles in K2p-F , 2008, Discret. Math..

[3] Dean G. Hoffman,et al. Maximal Sets of 2-Factors and Hamiltonian Cycles , 1993, J. Comb. Theory, Ser. B.

[4] M. Meyniel. Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe oriente , 1973 .

[5] C. Rodger,et al. Maximal sets of hamilton cycles in complete multipartite graphs , 2003 .

[6] Bill Jackson,et al. Long paths and cycles in oriented graphs , 1981, J. Graph Theory.

[7] Christopher A. Rodger,et al. Maximal sets of Hamilton cycles in Kn, n , 2000, J. Graph Theory.

[8] Timothy W. Tillson. A Hamiltonian decomposition of K2m*, 2m >= 8 , 1980, J. Comb. Theory B.