A new result on local forbidden graph and hamiltonicity

被引：0
|
作者：
李国君
刘振宏
机构：
[1] Yantai Teachers’ College
[2] Beijing 100080
[3] Yantai 264000
[4] Chinese Academy of Sciences
[5] Institute of Systems Science
[6] Department of Mathematics
[7] China
来源：
Chinese Science Bulletin | 1996年 / 02期
关键词：
K1; 3; F]-free graph; Hamilton graph; VD-cycle;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
摘要：
In this note, we denote by G a graph with order n, by V and E the vertex set andedge set of G, respectively. V={v∈V|d(v)≥n/2}, V=V\V. Let H be a subgraph ofG. For simplicity, we also use H to denote the vertex set of it. For a∈V S, TV, put
引用
收藏
页码：93 / 99
页数：7
相关论文
共 50 条
12345