Affiliation of Author(s):山东大学数学学院

Journal:Combinatorica

Abstract: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.

All the Authors:Chen, C.,Liu, Z.

First Author:Li, G.

Indexed by:Journal paper

Discipline:Natural Science

First-Level Discipline:Mathematics

Document Type:J

Volume:25

Issue:4

Page Number:393-405

Translation or Not:no

Date of Publication:2005-07-01

Included Journals:SCI