A CHVATAL-ERDOS TYPE CONDITION FOR HAMILTONIAN GRAPHS

被引：3
|
作者：
LU, XY
机构：
[1] Department of Mathematics, University of Illinois at Urbana—Champaign, Urbana, Illinois
来源：
JOURNAL OF GRAPH THEORY | 1994年 / 18卷 / 08期
关键词：
D O I：
10.1002/jgt.3190180804
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a simple graph G of order n greater than or equal to 3, define theta(G) = min{(d(A,($) over bar A))/\($) over bar A\; empty-set not equal A subset of V). We shall prove the following Chvatal-Erdos type condition: If alpha(G) less than or equal to beta(G)n, then G is Hamiltonian. (C) 1994 John Wiley & Sons, Inc.
引用
收藏
页码：791 / 800
页数：10
相关论文
共 50 条
12345