摘要
连通因子问题与Hamilton问题和信息网络有着密切的联系.1993年,首先由M.Kano就该问题在[6]中提出了许多问题和猜想,接下来他又在[16]中提出了一些猜想.本文就连通因子问题在过去十年的主要进展进行了回顾并提出了若干可进一步研究的问题和猜想.
Connected factor problems in graphs are closely related to Hamilton problems and information networks. In 1993, M. Kano posed some problems and conjectures on this topic in [6]. Next, he gave some conjectures again in [16]. In this paper, it is surveyed the most advances of this topic during the past ten years and propose some problems and conjectures.
出处
《运筹学学报》
CSCD
北大核心
2005年第1期49-57,共9页
Operations Research Transactions
基金
The work is supported by NNSF (10471078)Research Foundation of Doctoral Discipline of Higher Education(20040422004)DRF of QFNU and NSF(Y2003G01)of Shandong Province.
