EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC

Zhi Quan HU

PDF(283 KB)

系统科学与复杂性(英文) ›› 2003, Vol. 16 ›› Issue (4) : 527-532.

论文

EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC

Zhi Quan HU

作者信息 +

EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC

Zhi Quan HU

Author information +

文章历史 +

摘要

Let G be a hamiltonian, bipartite graph on 2n vertices, where n>3. It isshown that if e(G)>n(n-1)/2 + 2 then G contains cycles of every possible even length.This improves a result of Entringer and Schmeichel.

Abstract

Let G be a hamiltonian, bipartite graph on 2n vertices, where n > 3. It is shown that if e(G) > n(n -1)/2 + 2 then G contains cycles of every possible even length. This improves a result of Entringer and Schmeichel.

导出引用

Zhi Quan HU. EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC. 系统科学与复杂性(英文), 2003, 16(4): 527-532

Zhi Quan HU. EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC. Journal of Systems Science and Complexity, 2003, 16(4): 527-532

PDF(283 KB)

110

Accesses

Citation

Detail

段落导航

摘要
Abstract
关键词
Key words
引用本文

收稿日期	修回日期	出版日期
1900-01-01	1900-01-01	2003-10-15
发布日期
2003-10-15

选择文件类型/文献管理软件名称

选择包含的内容

摘要

Abstract

关键词

Key words

引用本文

{{custom_sec.title}}

{{custom_sec.title}}

{{custom_fnGroup.title_cn}}

脚注

扫码分享

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

摘要

Abstract

关键词

Key words

引用本文

{{custom_sec.title}}

{{custom_sec.title}}

{{custom_fnGroup.title_cn}}

脚注