EVERY CONNECTED, LOCALLY CONNECTED NONTRIVIAL GRAPH WITH NO INDUCED CLAW IS HAMILTONIAN

被引：89

作者：

OBERLY, DJ ^{[1
]}

SUMNER, DP ^{[1
]}

机构：

[1] UNIV S CAROLINA,COLUMBIA,SC 29208

来源：

JOURNAL OF GRAPH THEORY | 1979年 / 3卷 / 04期

关键词：

D O I：

10.1002/jgt.3190030405

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is locally connected if every neighborthood induces a connected subgraph. We show here that every connected, locally connected graph on p ≥ 3 vertices and having no induced K1,3 is Hamiltonian. Several sufficient conditions for a line graph to be Hamiltonian are obtained as corollaries. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company

引用

页码：351 / 356

页数：6