Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs (Q1782047): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10255-018-0773-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions of fractional ID-\(k\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of \(k\)-factors in squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New isolated toughness condition for fractional $(g,f,n)$-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a graph to have \([a,b]\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum fractional factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional \((g,f)\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence of fractional \(k\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent-set-deletable factor-critical power graphs / 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 graphs to be fractional \((k,m)\)-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor / 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: NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL <i>k</i>-FACTORS OF GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129383841 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10255-018-0773-7 / rank
 
Normal rank

Latest revision as of 11:32, 11 December 2024

scientific article
Language Label Description Also known as
English
Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
scientific article

    Statements

    Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs (English)
    0 references
    0 references
    0 references
    18 September 2018
    0 references
    neighborhood
    0 references
    fractional \(k\)-factor
    0 references
    fractional ID-\(k\)-factor-critical graph
    0 references

    Identifiers