The Edmonds-Gallai decomposition for matchings in locally finite graphs (Q1053712): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q226999
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: François Bry / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and matroid partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Faktoren von Graphen. (1-factors of graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Locally Finite Graphs / rank
 
Normal rank

Latest revision as of 09:58, 14 June 2024

scientific article
Language Label Description Also known as
English
The Edmonds-Gallai decomposition for matchings in locally finite graphs
scientific article

    Statements

    The Edmonds-Gallai decomposition for matchings in locally finite graphs (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    infinite graph
    0 references
    factorization
    0 references
    perfect matching
    0 references
    near-1-factor
    0 references