点击次数：

所属单位：山东大学数学学院

发表刊物：Combinatorica

摘要：Let G = (V (G),E(G)) be a graph with vertex set V (G) and edge set E(G), and g and
f two positive integral functions from V (G) to Z+ − {1} such that g(v) ≤ f(v) ≤ dG(v)
for all v ∈V (G), where dG(v) is the degree of the vertex v. It is shown that every graph
G, including both a [g,f]-factor and a hamiltonian path, contains a connected [g,f + 1]-
factor. This result also extends Kano’s conjecture concerning the existence of connected
[k,k+ 1]-factors in graphs.

全部作者：Chen, C.,Liu, Z.

第一作者：Li, G.

论文类型：期刊论文

学科门类：理学

一级学科：数学

文献类型：J

卷号：25

期号：4

页面范围：393-405

是否译文：否

发表时间：2005-07-01

收录刊物：SCI