A new degree condition for graphs to have \([a,b]\)-factor (Q1764908): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighbourhood condition for graphs to have \([a,b]\)-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: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287862 / rank
 
Normal rank

Revision as of 17:42, 7 June 2024

scientific article
Language Label Description Also known as
English
A new degree condition for graphs to have \([a,b]\)-factor
scientific article

    Statements

    A new degree condition for graphs to have \([a,b]\)-factor (English)
    0 references
    0 references
    22 February 2005
    0 references
    factor
    0 references
    \([a,b]\)-factor
    0 references
    \((a,b,n)\)-critical graph
    0 references

    Identifiers