A note on maximum fractional matchings of graphs (Q2075471): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-021-00766-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3167357745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional matching numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching preclusion number in product graphs / rank
 
Normal rank

Latest revision as of 01:05, 28 July 2024

scientific article
Language Label Description Also known as
English
A note on maximum fractional matchings of graphs
scientific article

    Statements

    A note on maximum fractional matchings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matching
    0 references
    Gallai-Edmonds decomposition
    0 references
    maximum fractional matching
    0 references
    fractional matching number
    0 references
    Cartesian product
    0 references
    strong product
    0 references
    lexicographic product
    0 references
    direct product
    0 references
    0 references