Hamiltonian connected claw-free graphs

被引：3

作者：

Li, M ^{[1
]}

机构：

[1] Tianjin Univ, Coll Elect Informat Engn, Dept Comp Sci & Technol, Tianjin 300072, Peoples R China

来源：

GRAPHS AND COMBINATORICS | 2004年 / 20卷 / 03期

关键词：

Minimum Degree; Hamiltonian Path; Nonadjacent Vertex; Hamiltonian Connect;

D O I：

10.1007/s00373-004-0559-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A well-known result by O. Ore is that every graph of order n with d(u)+d(v)greater than or equal ton+1 for any pair of nonadjacent vertices u and v is hamiltonian connected (i.e., for every pair of vertices, there is a hamiltonian path joining them). In this paper, we show that every 3-connected claw-free graph G on at most 5delta-8 vertices is hamiltonian connected, where delta denotes the minimum degree in G. This result generalizes several previous results.

引用

页码：341 / 362

页数：22