Title of article
Hamilton cycles in 1-tough triangle-free graphs Original Research Article
Author/Authors
Xiangwen Li، نويسنده , , Bing Wei، نويسنده , , Zhengguang Yu، نويسنده , , Yongjin Zhu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
13
From page
275
To page
287
Abstract
A graph G is called triangle-free if G has no induced K3 as a subgraph. We set σ3=min{∑i=13 d(vi)|{v1,v2,v3} is an independent set of vertices in G}. In this paper, we show that if G is a 1-tough and triangle-free graph of order n with n⩽σ3, then G is hamiltonian.
Keywords
1-tough , Triangle-free , Hamiltonian graph
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
950156
Link To Document