HAMILTONISM, DEGREE SUM AND NEIGHBORHOOD INTERSECTIONS

被引：44

作者：

FLANDRIN, E

JUNG, HA

LI, H

机构：

[1] TECH UNIV BERLIN,FACHBEREICH MATH,W-1000 BERLIN 12,GERMANY

[2] CHINESE ACAD SCI,INST SYST SCI,BEIJING,PEOPLES R CHINA

来源：

DISCRETE MATHEMATICS | 1991年 / 90卷 / 01期

关键词：

D O I：

10.1016/0012-365X(91)90094-I

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give a sufficient condition for hamiltonism of a 2-connected graph involving the degree sum and the neighborhood intersection of any three independent vertices.

引用

页码：41 / 52

页数：12

共 8 条

[1] METHOD IN GRAPH THEORY [J].

BONDY, JA ;

CHVATAL, V .

DISCRETE MATHEMATICS, 1976, 15 (02) :111-135

[2]

FAUDREE RJ, IN PRESS J COMBIN B

[3]

FAUDREE RJ, 1988, NEIGHBOURHOOD UNIONS

[4]

FLANDRIN E, 1988, 406 U PAR SUD RAPP R

[5] A NEW SUFFICIENT CONDITION FOR HAMILTONIAN GRAPHS [J].

FRAISSE, P .

JOURNAL OF GRAPH THEORY, 1986, 10 (03) :405-409

[6] LONGEST PATHS AND CYCLES IN K1,3-FREE GRAPHS [J].

MATTHEWS, MM ;

SUMNER, DP .

JOURNAL OF GRAPH THEORY, 1985, 9 (02) :269-277

[7]

Ore O., 1960, AM MATH MON, V67, P55, DOI [10.2307/2308928, DOI 10.2307/2308928]

[8] HAMILTON CYCLES IN CLAW-FREE GRAPHS [J].

ZHANG, CQ .

JOURNAL OF GRAPH THEORY, 1988, 12 (02) :209-216

← 1 →