Special parity of perfect matchings in bipartite graphs (Q1812865): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Ron Aharoni / rank
 
Normal rank
Property / author
 
Property / author: Bronisław Wajnryb / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative Economics and the Scope of the Correspondence Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic and diagonal products on a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signsolvability revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretical approach to qualitative solvability of linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices / rank
 
Normal rank

Latest revision as of 16:03, 14 May 2024

scientific article
Language Label Description Also known as
English
Special parity of perfect matchings in bipartite graphs
scientific article

    Statements

    Special parity of perfect matchings in bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    bipartite graph
    0 references
    perfect matching
    0 references
    real matrix
    0 references

    Identifiers