On the forced matching numbers of bipartite graphs (Q1827691)

From MaRDI portal
Revision as of 19:25, 6 June 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
On the forced matching numbers of bipartite graphs
scientific article

    Statements

    On the forced matching numbers of bipartite graphs (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    Forcing number
    0 references
    Matching in graphs
    0 references
    Unique matchings
    0 references
    Hypercubes
    0 references
    0 references