Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs (Q2461313): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple existence criterion for \((g<f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for the existence of regular factors inK1,n-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition for the existence of \(k\)-factors in graphs / rank
 
Normal rank

Latest revision as of 12:34, 27 June 2024

scientific article
Language Label Description Also known as
English
Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs
scientific article

    Statements

    Identifiers