A note on Hamiltonian cycles in K1,r-free graphs

被引：0

作者：

Li, R ^{[1
]}

机构：

[1] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA

来源：

ARS COMBINATORIA | 1999年 / 51卷

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is called K-1,K-r-free if it does not contain K-1,K-r as an induced subgraph. In this paper we generalize a theorem of Markus for Hamiltonicity of 2-connected K-1,K-r-free (r greater than or equal to 5) graphs and present a sufficient condition for 1-tough K-1,K-r-free (r greater than or equal to 4) graphs to be Hamiltonian.

引用

页码：199 / 203

页数：5