Sufficient conditions for graphs to have \((g,f)\)-factors (Q1916381): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:15, 5 March 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for graphs to have \((g,f)\)-factors
scientific article

    Statements

    Sufficient conditions for graphs to have \((g,f)\)-factors (English)
    0 references
    0 references
    0 references
    9 December 1996
    0 references
    This paper gives sufficient conditions for a graph to have a \((g,f)\)-factor. For example, if \(g(v) < f(v)\) for all vertices \(v\) of \(G\) and \(g(x)/ \deg_G (x) \leq f(y)/ \deg_G (y)\) for all adjacent vertices \(x\) and \(y\) of \(G\), then \(G\) has a \((g,f)\)-factor.
    0 references
    \((g,f)\)-factor
    0 references

    Identifiers