Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (Q5091506): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:42, 8 February 2024
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
26 July 2022
0 references
