Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs (Q1032542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On toughness and \((g,f)\)-factors in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree of a graph and the existence of k-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new degree condition for graphs to have \([a,b]\)-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492603 / 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: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287862 / 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: Some results on binding number and fractional perfect matching / rank
 
Normal rank

Latest revision as of 02:53, 2 July 2024

scientific article
Language Label Description Also known as
English
Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
scientific article

    Statements

    Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs (English)
    0 references
    0 references
    0 references
    26 October 2009
    0 references
    0 references
    graph
    0 references
    \((g,f)\)-factor
    0 references
    \((g,f,n)\)-critical graph
    0 references
    binding number
    0 references
    minimum degree
    0 references
    0 references