Pseudo-Matchings of a Bipartite Graph (Q4769073): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3261001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank

Latest revision as of 14:40, 12 June 2024

scientific article; zbMATH DE number 3443681
Language Label Description Also known as
English
Pseudo-Matchings of a Bipartite Graph
scientific article; zbMATH DE number 3443681

    Statements

    0 references
    0 references
    1974
    0 references
    Pseudo-Matchings of a Bipartite Graph (English)
    0 references

    Identifiers