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 条

[41] A SUFFICIENT CONDITION FOR ORIENTED GRAPHS TO BE HAMILTONIAN
FAVARON, O
ORDAZ, O
DISCRETE MATHEMATICS, 1986, 58 (03) : 243 - 252
[42] A sufficient condition on upper embeddability of graphs
Cai JunLiang
Dong GuangHua
Liu YanPei
SCIENCE CHINA-MATHEMATICS, 2010, 53 (05) : 1377 - 1384
[43] A Sufficient Condition for Pfaffian Graphs on the Torus
Xing Feng
Lianzhu Zhang
Mingzu Zhang
Graphs and Combinatorics, 2017, 33 : 1249 - 1260
[44] A Sufficient Condition for Pfaffian Graphs on the Torus
Feng, Xing
Zhang, Lianzhu
Zhang, Mingzu
GRAPHS AND COMBINATORICS, 2017, 33 (05) : 1249 - 1260
[45] A NECESSARY AND SUFFICIENT CONDITION FOR ACYCLIC GRAPHS
RAVI, R
PROCEEDINGS OF THE IEEE, 1985, 73 (02) : 369 - 370
[46] A sufficient condition for boundedness of tolerance graphs
Eisermann, Birk
DISCRETE APPLIED MATHEMATICS, 2011, 159 (17) : 2165 - 2169
[47] ONE SUFFICIENT CONDITION FOR HAMILTONIAN GRAPHS
CHEN, GT
JOURNAL OF GRAPH THEORY, 1990, 14 (04) : 501 - 508
[48] A sufficient condition for cyclability in directed graphs
Li, Hao
Flandrin, Evelyne
Shu, Jinlong
DISCRETE MATHEMATICS, 2007, 307 (11-12) : 1291 - 1297
[49] A sufficient condition for oriented graphs to be Hamiltonian
Qiang, PL
Min, ZK
ARS COMBINATORIA, 2000, 55 : 283 - 287
[50] A new sufficient condition for Hamiltonian graphs
Gould, Ronald J.
Zhao, Kewen
ARKIV FOR MATEMATIK, 2006, 44 (02): : 299 - 308

← 1 2 3 4 5 →