Matching extension and minimum degree (Q1363649): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4033687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending subpermutation matrices in regular classes of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree of bipartite graphs and the existence of k-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defect-d matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank

Revision as of 17:10, 27 May 2024

scientific article
Language Label Description Also known as
English
Matching extension and minimum degree
scientific article

    Statements

    Matching extension and minimum degree (English)
    0 references
    0 references
    0 references
    10 November 1997
    0 references
    perfect matching
    0 references
    \(k\)-extendable graphs
    0 references
    bipartite graph
    0 references

    Identifiers