A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs (Q2161272): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q113877240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of all generalized fractional \((g, f)\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A toughness condition for fractional \((k, m)\)-deleted graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sum condition for fractional ID-$k$-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extension degree conditions for fractional factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for fractional \((g, f, n)\)-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, binding number and restricted matching extension in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on fractional critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of forbidden subgraphs for the existence of even factors in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2820205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for fractional \([a,b]\)-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding numbers and restricted fractional \(( g , f )\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on path-factor critical avoidable graphs / 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: Remarks on path factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some existence theorems on path factors with given properties in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[<i>a</i>,<i>b</i>]-FACTOR-CRITICAL GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for fractional \((a,b,k)\)-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on fractional ID-\(k\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with orthogonal factorizations in graphs / rank
 
Normal rank

Latest revision as of 19:28, 29 July 2024

scientific article
Language Label Description Also known as
English
A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
scientific article

    Statements

    A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    neighborhood
    0 references
    minimum degree
    0 references
    fractional ID-\( [ a, b ]\)-factor
    0 references
    fractional ID-\( [ a, b ]\)-factor-critical covered graph
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references