王维凡
professor
Gender : Male
Alma Mater : 南京大学
Education Level : Graduate student graduate
Degree : Doctorate
Status : 退休
School/Department : 数学科学学院
Date of Employment : 2002-05-01
Hits :
First Author : Gao, W
Affiliation of Author(s): 数理与信息工程学院
Date of Publication : 2014-01-01
Document Type : 期刊
Journal : ARS COMBINATORIA
Volume: Vol.113A
Page Number : 273-285
ISSN : 0381-7032
Translation or Not : no
Key Words : graph;fractional;factor;fractional;(k,;m)-deleted;graph;degree;condition
Abstract : A graph G is called a fractional (k, m)-deleted graph if after deleting any m edges of G the resulting graph admits a fractional k-factor. In this paper, we prove that for k >= 2 and m >= 0, G is a fractional (k, m)-deleted graph if one of the following c
