A sufficient condition for graphs to be
โ
Sizhong Zhou
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 218 KB
graph a b s t r a c t Let G be a graph, and k a positive integer. Let h : E(G) โ [0, 1] be a function. If โ eโx h(e) = k holds for each x โ V (G), then we call G[F h ] a fractional k-factor of G with indicator function h where F h = {e โ E(G) : h(e) > 0}. A graph G is called a fractional (k, m)delet