强连通竞赛图的圈分解(英文)  

Cyclic Partition of Strong Tournaments

作　　者：束金龙[1] 李皓 

机构地区：[1]华东师范大学数学系 [2]L.R.I.,Bat.490,Universite de Paris-Sud,91405,Orsay Cedex,France

出　　处：《运筹学学报》2004年第1期53-61,共9页Operations Research Transactions

基　　金：The research was partially supported by NNSF of china(19971027,10271048);Shanghai Priority Academic Discipline.The research was done while the first author was visiting LRI.

摘　　要：设T为n阶强连通竞赛图.本文通过详细刻画不能进行圈分解的强连通竞赛 图的特征,证明了满足maX{δ+,δ-}>5k-5和k>2的强连通竞赛图T,能够分解为k 个圈.Let T be a strong tournament with n vertices. In this paper, by using a characterization of strong tournaments which can not be vertex partitioned, we show that if T is a strong n-tournament with max{δ+,δ-} > 5k - 5 and k > 2, then T can be partitioned into k cycles.

关 键 词：强连通竞赛图 圈分解 传递竞赛图 hamiltonian圈 

分 类 号：O157.5[理学—数学]