Title of article
Sufficient conditions for graphs to have (g, f)-factors Original Research Article
Author/Authors
We give sufficient conditions for a graph to have a (g، نويسنده , , f)-factor. For example، نويسنده , , we prove that a graph G has a (g، نويسنده , , f)-factor if g(v) < f(v) for all vertices v of G and g(x)/degG(x) ? f (y)/degG(y) for all adjacent vertices x and y of G.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
87
To page
90
Abstract
Yoshimi Egawa, Mikio Kano
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943765
Link To Document