More applications of the \(d\)-neighbor equivalence: connectivity and acyclicity constraints (Q5075752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: More applications of the d-neighbor equivalence: connectivity and acyclicity constraints |
scientific article; zbMATH DE number 7525454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More applications of the \(d\)-neighbor equivalence: connectivity and acyclicity constraints |
scientific article; zbMATH DE number 7525454 |
Statements
11 May 2022
0 references
connectivity problem
0 references
feedback vertex set
0 references
\(d\)-neighbor equivalence
0 references
\({\sigma
0 references
\rho}\)-domination
0 references
clique-width
0 references
rank-width
0 references
mim-width
0 references
0 references
0 references
0 references
0 references
0.9756964445114136
0 references
0.7772576212882996
0 references
0.7422103881835938
0 references
0.7411958575248718
0 references
0.7380416989326477
0 references
