Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties (Q1753364): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964082890 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964082890 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.3497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified existence theorems for \((g,f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors with a bounded number of odd components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete factors and \(f\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors and eigenvalues of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding numbers of fractional \(k\)-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient condition for the existence of an even \([a,b]\)-factor in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional \((g,f)\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified existence theorems on all fractional \([a,b]\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs having all \((g,f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number, connectivity and \((a,b,k)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on orthogonal factorizations of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results about component factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On all fractional \({(a,b,k)}\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs / rank
 
Normal rank

Latest revision as of 17:09, 15 July 2024

scientific article
Language Label Description Also known as
English
Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
scientific article

    Statements

    Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties (English)
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    fractional \((g,f)\)-factor
    0 references
    all fractional \((g,f)\)-factors
    0 references

    Identifiers