山东科学2011，Vol.24Issue(1)：68-71,4.
2-连通[4,1]-图的Hamilton圈
Hamilton cycles of 2-connected [4,1 ] -graphs
张伟 1王江鲁1
作者信息
- 1. 山东师范大学数学科学学院,山东,济南,250014
- 折叠
摘要
Abstract
A graph G is a [ s, t ] -graph if there are at least t edges in every included subgraph of s vertices. This paper proves that the sufficient and necessary condition of a 2-connected [ 4,1 ] -graph to be a Hamilton cycle is that it is not isomorphic to three kinds of specific graphs.关键词
[s,t]-图/Hamilton圈/连通Key words
[s,t]-graph/ Hamilton cycle/ connectivity分类
数理科学引用本文复制引用
张伟,王江鲁..2-连通[4,1]-图的Hamilton圈[J].山东科学,2011,24(1):68-71,4.
