A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Perfect matchings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Latest revision as of 14:15, 4 July 2024

scientific article
Language Label Description Also known as
English
A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
scientific article

    Statements

    A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (English)
    0 references
    0 references
    24 October 2011
    0 references
    0 references
    matching, bigraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references