期刊文献+

Hamiltonian二部竞赛图中的充分条件

A sufficient condition in Hamiltonian bipartite tournament
下载PDF
导出
摘要 证明了对于一个n×n阶二部竞赛图T,如果T(n,n)满足W(n)条件,则T(n,n)中包含长为4,6,2n的圈,除非T同构于一类特殊的图族。 For a n×n bipartite tournament T(n,n),we prove that if T(n,n) meets the conditions of W(n),then T(n,n) contains a cycle of length 4,6,2n unless T(n,n) is isomorphic to a family of specified graphs.
出处 《长春工业大学学报》 CAS 2010年第3期291-293,共3页 Journal of Changchun University of Technology
关键词 二部竞赛图 强连通 同构 bipartite tournament strong connection isomorphic.
  • 相关文献

参考文献6

  • 1Bondy J A,Murty U S R.Graph theory with applications[M].New York:Macmillan,1976.
  • 2Jackson B.Long paths and cycles in oriented graphs[J].J.Graph Theory,1981,5(2):154-157.
  • 3Wang J Z.Long cycles in bipartite tournaments[J].Discrete Math.,1996,144:217-225.
  • 4Wang J Z.A sufficient condition for hamiltonian cycles in bipartite tournaments[J].Australsian Journal of Combinatorics,1992(5):299-304.
  • 5Haggkvist R,Manoussakis Y.Cycles and paths in bipartite tournaments with spanning configurations[J].Combinatiorica,1989,9(1):51-56.
  • 6Lei W P,Wang J Z.A sufficient condition for hamiltonian cycles in bipartite tournaments[J].Australsian Journal of Combinatorics,2007(38):211-220.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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