Generalization of matching extensions in graphs. IV: Closures (Q343759): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure and Hamiltonian-connectivity of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of matching extensions in graphs. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of matching extensions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure and factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 1-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Factors and Matching Extensions / rank
 
Normal rank

Latest revision as of 23:53, 12 July 2024

scientific article
Language Label Description Also known as
English
Generalization of matching extensions in graphs. IV: Closures
scientific article

    Statements

    Generalization of matching extensions in graphs. IV: Closures (English)
    0 references
    0 references
    0 references
    29 November 2016
    0 references
    \(k\)-matching
    0 references
    matching extension
    0 references
    \((n,k,d)\)-graph
    0 references
    closure
    0 references

    Identifiers