摘要
证明了当图Ｇ的边数ε（Ｇ）与顶点数ｖ（Ｇ）满足ε（Ｇ）≥ｖ（Ｇ）＋９且ｖ（Ｇ）≤１７时，图Ｇ含有三个边不交的圈。
This paper proves that if graph G satisfies ε (G)≥v(G)+9,v(G)≤17, then G has three disjoint cycles,and points out that this result is optimal.
出处
《武汉交通科技大学学报》
1996年第5期618-620,共3页
Journal of Wuhan University of Technology(Transportation Science & Engineering)
关键词
图
圈
图论
graph
cycle
isomorphism
