Bipartite matching extendable graphs (Q998414): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings and ears in elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of minimally \(n\)-extendable bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal IM-unextendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane elementary bipartite graphs / rank
 
Normal rank

Latest revision as of 01:07, 29 June 2024

scientific article
Language Label Description Also known as
English
Bipartite matching extendable graphs
scientific article

    Statements

    Bipartite matching extendable graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    0 references
    graph theory
    0 references
    matching
    0 references
    bipartite matching
    0 references
    bipartite-matching extendable
    0 references
    0 references