Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (Q5091506)

From MaRDI portal
Revision as of 12:08, 16 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7564164
Language Label Description Also known as
English
Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings
scientific article; zbMATH DE number 7564164

    Statements

    Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 July 2022
    0 references
    0 references
    0 references
    0 references
    0 references