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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1415536
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nawarat Ananchuen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00352-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973436029 / rank
 
Normal rank

Latest revision as of 10:12, 30 July 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