Computing the forcing spectrum of outerplanar graphs in polynomial time (Q6928003)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8095549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the forcing spectrum of outerplanar graphs in polynomial time |
scientific article; zbMATH DE number 8095549 |
Statements
Computing the forcing spectrum of outerplanar graphs in polynomial time (English)
0 references
17 September 2025
0 references
forcing number
0 references
forcing spectrum
0 references
perfect matching
0 references
outerplanar graphs
0 references
tight cut decomposition
0 references
polynomial time algorithm
0 references
0 references
