A sufficient condition for graphs with large neighborhood unions to be traceable

被引：4
|
作者：
Ren, SJ [1 ]
机构：
[1] KESHAN TEACHERS COLL,DEPT MATH,HEILONGJIANG 161601,PEOPLES R CHINA
来源：
DISCRETE MATHEMATICS | 1996年 / 161卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(95)00230-T
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that a 2-connected graph G of order p is traceable if /N(u)boolean OR N(v)/+ /N(w)boolean OR N(x)/greater than or equal to p-1 for all 4-tuples {u, v, w, x} with d(u, v)=d(w, x)=2(u, v, w,x are distinct vertices of G). In addition, we give a short proof of Lindquester's conjecture.
引用
收藏
页码：229 / 234
页数：6
相关论文
共 50 条
12345