HamiltonianCyclesin2-ConnectedClaw-FreeGraphs

您当前的位置：

首页 >

文章列表页 >

HamiltonianCyclesin2-ConnectedClaw-FreeGraphs

工程技术 | 更新时间：2026-01-21

- HamiltonianCyclesin2-ConnectedClaw-FreeGraphs
- HamiltonianCyclesin2-ConnectedClaw-FreeGraphs
- 新疆大学学报（自然科学版中英文） 1999年第1期
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  中图分类号： O153.3
- 纸质出版：1999
- 稿件说明：
移动端阅览
[1].Hamiltonian Cycles in 2-Connected Claw-Free Graphs[J].新疆大学学报(自然科学版),1999(01).

HamiltonianCyclesin2-ConnectedClaw-FreeGraphs[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1999, (1).
[1].Hamiltonian Cycles in 2-Connected Claw-Free Graphs[J].新疆大学学报(自然科学版),1999(01). DOI：

HamiltonianCyclesin2-ConnectedClaw-FreeGraphs[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1999, (1). DOI：

摘要

１ＩｎｔｒｏｄｕｃｉｔｉｏｎＩｎｔｈｉｓｐａｐｅｒｗｅｄｅａｌｗｉｔｈｆｉｎｉｔｅｓｉｍｐｌｅｇｒａｐｈｓ．ＬｅｔＧｂｅａｇｒａｐｈ．Ｗｅｄｅｎｏｔｅｂｙδ（Ｇ）（ｏｒδ）ａｎｄｋ（Ｇ）ｔｈｅｍｉｎｉｍｕｍｄｅｇｒｅｅａｎｄｔｈｅｃｏｎｎｅｃｔｉｖｉ...

Abstract

A Known result by Matthews and Summer is that every 2 connected claw free graph on at most 3δ+2 vertices is hamiltonian.In this paper

we generalize this result and show that every 2 connected claw free graph G on at most 5δ-5 vertices is hamiltonian unless G belongs to one of three classes of exceptional graphs.

关键词

Keywords

references

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据