Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs

Shengning Qiao, Shenggui Zhang

科研成果: 期刊稿件文章同行评审

2 引用 (Scopus)

摘要

Let G be a graph on n ≥ 3 vertices and H be a subgraph of G such that each component of H is a cycle with at most one chord. In this paper we prove that if the minimum degree of G is at least n/2, then G contains a spanning subdivision of H such that only non-chord edges of H are subdivided. This gives a new generalization of the classical result of Dirac on the existence of Hamilton cycles in graphs.

源语言英语
页(从-至)277-285
页数9
期刊Graphs and Combinatorics
28
2
DOI
出版状态已出版 - 3月 2012

指纹

探究 'Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs' 的科研主题。它们共同构成独一无二的指纹。

引用此