Vertex-Disjoint Cycles Containing Specified Edges
Vertex-Disjoint Cycles Containing Specified Edges
复制标题
包含指定边的顶点不相交循环
DOI：
10.1007/s003730050005
复制
发表时间：
2000
影响因子：
0.7
通讯作者：
Hong Wang
中科院分区：
文献类型：
--
作者：
Y. Egawa;R. Faudree;E. Györi;Y. Ishigami;R. Schelp;Hong Wang
抽象。给出了一个图含有顶点不交圈且每个圈含有一条预先指定的边的Dirac和Ore型度条件。给出一组条件，暗示顶点不相交的循环的长度最多为4，另一组条件给出暗示存在的循环，跨越所有的顶点的图（即2-因子）。证明了这些条件是严格的，并对Enomoto在[3]和Wang在[5]中的定理给出了肯定的回答。
Abstract. Dirac and Ore-type degree conditions are given for a graph to contain vertex disjoint cycles each of which contains a previously specified edge. One set of conditions is given that imply vertex disjoint cycles of length at most 4, and another set of conditions are given that imply the existence of cycles that span all of the vertices of the graph (i.e. a 2-factor). The conditions are shown to be sharp and give positive answers to conjectures of Enomoto in [3] and Wang in [5].