Existence of Dlambda-cycles and Dlambda-paths
Existence of Dlambda-cycles and Dlambda-paths
复制标题
Dlambda 循环和 Dlambda 路径的存在
DOI：
10.1016/0012-365x(83)90196-6
复制
发表时间：
1983
期刊：
影响因子：
--
通讯作者：
H. J. Veldman
中科院分区：
文献类型：
--
作者：
H. J. Veldman
一个图G的C的圈称为D λ-圈，如果G −V（C）的每个分支的阶都小于λ。ADλ-路径被类似地定义。特别地，aD 1-圈是哈密尔顿圈，aD 1-路是哈密尔顿路，给出了图存在aDλ-圈或D λ-路的必要条件和充分条件，推广了哈密尔顿图论中的定理.扩展的概念，如顶点的程度和邻接的顶点，以子图的阶大于1出现在一个自然的方式。
A cycle ofCof a graphGis called aDλ-cycle if every component ofG−V(C) has order less than λ. ADλ-path is defined analogously. In particular, aD1-cycle is a hamiltonian cycle and aD1-path is a hamiltonian path. Necessary conditions and sufficient conditions are derived for graphs to have aDλ-cycle orDλ-path. The results are generalizations of theorems in hamiltonian graph theory. Extensions of notions such as vertex degree and adjacency of vertices to subgraphs of order greater than 1 arise in a natural way.