Minimal graphs for matching extensions (Q1686047): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Generalization of matching extensions in graphs. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extendability of matchings in strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and matching extension in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank

Latest revision as of 21:54, 14 July 2024

scientific article
Language Label Description Also known as
English
Minimal graphs for matching extensions
scientific article

    Statements

    Minimal graphs for matching extensions (English)
    0 references
    20 December 2017
    0 references
    maximum matching
    0 references
    matching extension
    0 references
    expandable graph
    0 references
    completable graph
    0 references
    0 references
    0 references
    0 references

    Identifiers