Characterizations of maximum fractional \((g,f)\)-factors of graphs (Q947113): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simplified existence theorems for \((g,f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \((g,f)\)-factors of a general graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional \((g,f)\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of fractional \(k\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional matchings and the Edmonds-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744319 / rank
 
Normal rank

Latest revision as of 17:48, 28 June 2024

scientific article
Language Label Description Also known as
English
Characterizations of maximum fractional \((g,f)\)-factors of graphs
scientific article

    Statements

    Characterizations of maximum fractional \((g,f)\)-factors of graphs (English)
    0 references
    0 references
    0 references
    29 September 2008
    0 references
    0 references
    fractional \((g, f)\)-factor
    0 references
    fractional matching
    0 references
    augmenting chain
    0 references
    0 references