A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (<i>f</i>, <i>n</i>)-CRITICAL GRAPH (Q3564624): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Fan-type results for the existence of [\(a\),\(b\)]-factors / 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: The stability number and connected \([k,k+1]\)-factor in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fractional \((f,n)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on the binding numbers for (<i>a, b, k</i>)-critical 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

Revision as of 21:23, 2 July 2024

scientific article
Language Label Description Also known as
English
A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (<i>f</i>, <i>n</i>)-CRITICAL GRAPH
scientific article

    Statements