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

From MaRDI portal
Revision as of 19:54, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A lower bound on the acyclic matching number of subcubic graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references