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 : 225-233

ISSN : 0381-7032

Translation or Not : no

Key Words : graph;fractional;factor;fractional;(k,;m)-deleted;graph;neighborhood;union;condition

Abstract : A graph G is called a fractional (k, m)-deleted graph if any in edges are removed from G then the resulting graph admits a fractional k-factor. In this paper, we prove that for integers k >= 2, m >= 0, n >= 8k + 4m - 7, and delta(G) >= k + m, if vertical