A lower bound on the acyclic matching number of subcubic graphs (Q1637156)

From MaRDI portal
Revision as of 21:12, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A lower bound on the acyclic matching number of subcubic graphs
scientific article

    Statements

    A lower bound on the acyclic matching number of subcubic graphs (English)
    0 references
    0 references
    0 references
    7 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    acyclic matching
    0 references
    subcubic graph
    0 references
    0 references
    0 references