A GENERALIZATION OF FAN CONDITION FOR HAMILTONICITY, PANCYCLICITY, AND HAMILTONIAN CONNECTEDNESS

被引：31

作者：

BEDROSSIAN, P ^{[1
]}

CHEN, G ^{[1
]}

SCHELP, RH ^{[1
]}

机构：

[1] MEMPHIS STATE UNIV,DEPT MATH,MEMPHIS,TN 38152

来源：

DISCRETE MATHEMATICS | 1993年 / 115卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(93)90476-A

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A weakened version of Fan's condition for Hamiltonicity is shown to be sufficient for a 2-connected graph to be pancyclic (with a few exceptions). Also, a similar condition is shown to be sufficient for a 3-connected graph to be Hamiltonian-connected. These results generalize the earlier work of Benhocine and Wodja (1987).

引用

页码：39 / 50

页数：12

共 6 条

[1] THE GENG-HUA FAN CONDITIONS FOR PANCYCLIC OR HAMILTON-CONNECTED GRAPHS [J].