Characterizing defect \(n\)-extendable bipartite graphs with different connectivities (Q882112): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Two results on matching extensions with prescribed and proscribed edge sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matching extensions with prescribed and proscribed edge sets. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted matching extension in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defect-d matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of matching extensions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139763 / 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: Q4393233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal IM-unextendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-regular claw-free IM-extendable graphs / rank
 
Normal rank

Revision as of 18:53, 25 June 2024

scientific article
Language Label Description Also known as
English
Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
scientific article

    Statements

    Characterizing defect \(n\)-extendable bipartite graphs with different connectivities (English)
    0 references
    0 references
    0 references
    23 May 2007
    0 references
    near perfect matching
    0 references

    Identifiers