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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Pseudo-Matchings of a Bipartite Graph
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2039670 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4235944073 / rank
 
Normal rank
Property / title
 
Pseudo-Matchings of a Bipartite Graph (English)
Property / title: Pseudo-Matchings of a Bipartite Graph (English) / rank
 
Normal rank
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