期刊文献+

EXISTENCE OF HAMILTONIAN k-FACTOR

EXISTENCE OF HAMILTONIAN k-FACTOR
原文传递
导出
摘要 A Hamiltonian k-factor is a k-factor containing aHamiltonian cycle.An n/2-critical graph G is a simple graph of order n which satisfies δ(G)≥n/2 and δ(G-e)<n/2 for any edge e∈E(G).Let k≥2 be an integer and G be an n/2-critical graph of even order n≥8k-14.It is shown in this paper that for any given Hamiltonian cycle C except that G-C consists of two components of odd orders when k is odd,G has a k-factor containing C.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2004年第4期464-471,共8页 系统科学与复杂性学报(英文版)
基金 This research is supported partially by the National Natural Science Foundation of China.
关键词 K-FACTOR hamiltonian k-factor hamiltonian cycle n/2-critical graph 哈密顿k-因子 哈密顿循环 n/2-临界图 奇数
  • 相关文献

参考文献6

  • 1G. A. Dirac, Some theorem on abstract graphs, Prof. London Math. Soc., 1952, 2: 69-81.
  • 2B. Wei and Y. Zhu, Hamiltonian k-factors in graphs, J. Graph Theory, 1997, 25: 217-227.
  • 3W. T. Tutte. The factors of graohs, Canad. J: Math., 1952, 4: 314-328.
  • 4P. Katerinis and D. R. Woodall, Binding numbers of graphs and the existence of d-factors, Quart.J. Math., 1987, 38: 221-228.
  • 5M. Kano, Some current results and problems on factors of graphs, in Proc. 3-rd China-USA Internat. Conf. on Graph Theory and Its Applications, World Sci. Publishing, River Edge N J,1994, pp. 93-98.
  • 6W. T.Tutte, Graph factors,Combinatorica, 1981, 1:79-97.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部